./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-min-max-1.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/parallel-min-max-1.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 bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:20:38,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:20:38,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:20:38,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:20:38,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:20:38,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:20:38,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:20:38,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:20:38,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:20:38,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:20:38,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:20:38,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:20:38,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:20:38,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:38,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:20:38,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:20:38,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:20:38,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:20:38,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:20:38,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:20:38,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:20:38,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:20:38,170 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 -> bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 [2025-03-04 02:20:38,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:20:38,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:20:38,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:20:38,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:20:38,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:20:38,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-04 02:20:39,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4217f8418/535c22f0a339477fa24c489887dafd8e/FLAGce149e9fa [2025-03-04 02:20:39,740 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:20:39,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-04 02:20:39,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4217f8418/535c22f0a339477fa24c489887dafd8e/FLAGce149e9fa [2025-03-04 02:20:40,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4217f8418/535c22f0a339477fa24c489887dafd8e [2025-03-04 02:20:40,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:20:40,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:20:40,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:40,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:20:40,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:20:40,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762996bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40, skipping insertion in model container [2025-03-04 02:20:40,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:20:40,161 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/parallel-min-max-1.wvr.c[2642,2655] [2025-03-04 02:20:40,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:40,172 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:20:40,192 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/parallel-min-max-1.wvr.c[2642,2655] [2025-03-04 02:20:40,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:40,213 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:20:40,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40 WrapperNode [2025-03-04 02:20:40,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:40,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:40,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:20:40,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:20:40,218 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:20:40" (1/1) ... [2025-03-04 02:20:40,223 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:20:40" (1/1) ... [2025-03-04 02:20:40,233 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-04 02:20:40,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:40,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:20:40,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:20:40,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:20:40,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,251 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:20:40,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,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:20:40" (1/1) ... [2025-03-04 02:20:40,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:20:40,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:20:40,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:20:40,260 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:20:40,261 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (1/1) ... [2025-03-04 02:20:40,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:40,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:40,287 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:20:40,289 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:20:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:20:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:20:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:20:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:20:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:20:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:20:40,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:20:40,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:20:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:20:40,306 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:20:40,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:20:40,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:20:40,631 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:20:40,631 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:20:40,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:20:40,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:20:40,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:40 BoogieIcfgContainer [2025-03-04 02:20:40,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:20:40,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:20:40,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:20:40,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:20:40,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:20:40" (1/3) ... [2025-03-04 02:20:40,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a026cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:40, skipping insertion in model container [2025-03-04 02:20:40,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:40" (2/3) ... [2025-03-04 02:20:40,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a026cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:40, skipping insertion in model container [2025-03-04 02:20:40,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:40" (3/3) ... [2025-03-04 02:20:40,784 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-03-04 02:20:40,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:20:40,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 51 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:20:40,796 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:20:40,849 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:20:40,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 131 flow [2025-03-04 02:20:40,929 INFO L124 PetriNetUnfolderBase]: 5/52 cut-off events. [2025-03-04 02:20:40,930 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:20:40,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 5/52 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/46 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-04 02:20:40,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 55 transitions, 131 flow [2025-03-04 02:20:40,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 120 flow [2025-03-04 02:20:40,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:20:40,959 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;@544b446c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:20:40,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:20:40,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:20:40,974 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2025-03-04 02:20:40,974 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:20:40,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:40,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:40,976 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:20:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 475076644, now seen corresponding path program 1 times [2025-03-04 02:20:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:40,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356319749] [2025-03-04 02:20:40,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:40,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:41,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:20:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:20:41,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:41,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:41,330 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:20:41,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:41,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356319749] [2025-03-04 02:20:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356319749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:41,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575058616] [2025-03-04 02:20:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:41,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:41,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:41,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:41,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-03-04 02:20:41,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:41,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-03-04 02:20:41,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:41,755 INFO L124 PetriNetUnfolderBase]: 2431/3483 cut-off events. [2025-03-04 02:20:41,755 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-03-04 02:20:41,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 3483 events. 2431/3483 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16001 event pairs, 1290 based on Foata normal form. 0/2908 useless extension candidates. Maximal degree in co-relation 6906. Up to 2363 conditions per place. [2025-03-04 02:20:41,778 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 63 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-04 02:20:41,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 298 flow [2025-03-04 02:20:41,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-04 02:20:41,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:20:41,792 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 120 flow. Second operand 4 states and 99 transitions. [2025-03-04 02:20:41,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 298 flow [2025-03-04 02:20:41,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 282 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:41,803 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 122 flow [2025-03-04 02:20:41,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-03-04 02:20:41,809 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-03-04 02:20:41,810 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 122 flow [2025-03-04 02:20:41,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:41,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:41,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:20:41,811 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:20:41,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:41,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1727660416, now seen corresponding path program 1 times [2025-03-04 02:20:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:41,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026057080] [2025-03-04 02:20:41,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:41,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:20:41,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:20:41,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:41,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:41,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:41,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026057080] [2025-03-04 02:20:41,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026057080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:41,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:41,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:41,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084412609] [2025-03-04 02:20:41,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:41,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:41,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:41,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:41,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-03-04 02:20:41,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:20:41,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:41,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-03-04 02:20:41,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:42,280 INFO L124 PetriNetUnfolderBase]: 3152/4521 cut-off events. [2025-03-04 02:20:42,280 INFO L125 PetriNetUnfolderBase]: For 192/285 co-relation queries the response was YES. [2025-03-04 02:20:42,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 4521 events. 3152/4521 cut-off events. For 192/285 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 21309 event pairs, 1744 based on Foata normal form. 93/4075 useless extension candidates. Maximal degree in co-relation 2816. Up to 3097 conditions per place. [2025-03-04 02:20:42,299 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 66 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-04 02:20:42,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 313 flow [2025-03-04 02:20:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-04 02:20:42,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-04 02:20:42,306 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 122 flow. Second operand 4 states and 100 transitions. [2025-03-04 02:20:42,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 313 flow [2025-03-04 02:20:42,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:42,308 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 132 flow [2025-03-04 02:20:42,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-03-04 02:20:42,309 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-03-04 02:20:42,309 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 132 flow [2025-03-04 02:20:42,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:20:42,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:42,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:42,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:20:42,311 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:20:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash -788331397, now seen corresponding path program 1 times [2025-03-04 02:20:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733544431] [2025-03-04 02:20:42,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 02:20:42,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 02:20:42,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:42,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:42,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:42,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733544431] [2025-03-04 02:20:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733544431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:42,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597280907] [2025-03-04 02:20:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:42,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:42,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:42,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:42,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2025-03-04 02:20:42,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:20:42,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:42,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2025-03-04 02:20:42,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:42,791 INFO L124 PetriNetUnfolderBase]: 2930/4214 cut-off events. [2025-03-04 02:20:42,791 INFO L125 PetriNetUnfolderBase]: For 203/380 co-relation queries the response was YES. [2025-03-04 02:20:42,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 4214 events. 2930/4214 cut-off events. For 203/380 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19379 event pairs, 2338 based on Foata normal form. 177/3957 useless extension candidates. Maximal degree in co-relation 2769. Up to 4155 conditions per place. [2025-03-04 02:20:42,806 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 45 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-03-04 02:20:42,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 230 flow [2025-03-04 02:20:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 02:20:42,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-03-04 02:20:42,808 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 132 flow. Second operand 4 states and 83 transitions. [2025-03-04 02:20:42,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 230 flow [2025-03-04 02:20:42,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:42,809 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 142 flow [2025-03-04 02:20:42,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2025-03-04 02:20:42,810 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-03-04 02:20:42,810 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 142 flow [2025-03-04 02:20:42,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:20:42,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:42,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:42,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:20:42,811 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:20:42,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash -760508093, now seen corresponding path program 1 times [2025-03-04 02:20:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:42,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545883211] [2025-03-04 02:20:42,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:42,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:20:42,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:20:42,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:42,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545883211] [2025-03-04 02:20:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545883211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:43,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061510233] [2025-03-04 02:20:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:43,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:43,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:43,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:43,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-04 02:20:43,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:20:43,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:43,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-04 02:20:43,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:44,058 INFO L124 PetriNetUnfolderBase]: 8081/11550 cut-off events. [2025-03-04 02:20:44,058 INFO L125 PetriNetUnfolderBase]: For 1281/1602 co-relation queries the response was YES. [2025-03-04 02:20:44,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25494 conditions, 11550 events. 8081/11550 cut-off events. For 1281/1602 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 60260 event pairs, 1170 based on Foata normal form. 324/10822 useless extension candidates. Maximal degree in co-relation 25456. Up to 2512 conditions per place. [2025-03-04 02:20:44,102 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 129 selfloop transitions, 18 changer transitions 116/267 dead transitions. [2025-03-04 02:20:44,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 267 transitions, 1214 flow [2025-03-04 02:20:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:20:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:20:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 359 transitions. [2025-03-04 02:20:44,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40795454545454546 [2025-03-04 02:20:44,105 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 142 flow. Second operand 16 states and 359 transitions. [2025-03-04 02:20:44,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 267 transitions, 1214 flow [2025-03-04 02:20:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 267 transitions, 1208 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:44,112 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 247 flow [2025-03-04 02:20:44,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=247, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-03-04 02:20:44,113 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2025-03-04 02:20:44,113 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 247 flow [2025-03-04 02:20:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:20:44,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:44,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:44,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:20:44,114 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:20:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1085841141, now seen corresponding path program 1 times [2025-03-04 02:20:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982100628] [2025-03-04 02:20:44,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:44,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:20:44,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:20:44,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:44,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982100628] [2025-03-04 02:20:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982100628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:20:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40743494] [2025-03-04 02:20:44,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:44,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:44,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:44,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:44,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:44,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-03-04 02:20:44,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 247 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:44,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:44,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-03-04 02:20:44,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:45,622 INFO L124 PetriNetUnfolderBase]: 7953/11468 cut-off events. [2025-03-04 02:20:45,622 INFO L125 PetriNetUnfolderBase]: For 11019/11181 co-relation queries the response was YES. [2025-03-04 02:20:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31398 conditions, 11468 events. 7953/11468 cut-off events. For 11019/11181 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 58739 event pairs, 1141 based on Foata normal form. 159/10549 useless extension candidates. Maximal degree in co-relation 31366. Up to 3685 conditions per place. [2025-03-04 02:20:45,661 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 202 selfloop transitions, 40 changer transitions 104/349 dead transitions. [2025-03-04 02:20:45,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 349 transitions, 1842 flow [2025-03-04 02:20:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:20:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:20:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 471 transitions. [2025-03-04 02:20:45,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3568181818181818 [2025-03-04 02:20:45,664 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 247 flow. Second operand 24 states and 471 transitions. [2025-03-04 02:20:45,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 349 transitions, 1842 flow [2025-03-04 02:20:45,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 349 transitions, 1796 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:45,742 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 492 flow [2025-03-04 02:20:45,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=492, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2025-03-04 02:20:45,744 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 47 predicate places. [2025-03-04 02:20:45,744 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 492 flow [2025-03-04 02:20:45,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:45,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:45,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:45,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:20:45,745 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:20:45,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash -309623990, now seen corresponding path program 1 times [2025-03-04 02:20:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168667980] [2025-03-04 02:20:45,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:45,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:20:45,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:20:45,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:45,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:46,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:46,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168667980] [2025-03-04 02:20:46,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168667980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:46,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:46,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:20:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321464385] [2025-03-04 02:20:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:46,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:46,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:46,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:46,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-03-04 02:20:46,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 492 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:46,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:46,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-03-04 02:20:46,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:47,686 INFO L124 PetriNetUnfolderBase]: 9743/14073 cut-off events. [2025-03-04 02:20:47,686 INFO L125 PetriNetUnfolderBase]: For 33568/33760 co-relation queries the response was YES. [2025-03-04 02:20:47,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45455 conditions, 14073 events. 9743/14073 cut-off events. For 33568/33760 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 75425 event pairs, 1310 based on Foata normal form. 188/13559 useless extension candidates. Maximal degree in co-relation 45407. Up to 4567 conditions per place. [2025-03-04 02:20:47,764 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 225 selfloop transitions, 50 changer transitions 121/399 dead transitions. [2025-03-04 02:20:47,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 399 transitions, 2468 flow [2025-03-04 02:20:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 02:20:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 02:20:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 512 transitions. [2025-03-04 02:20:47,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35804195804195804 [2025-03-04 02:20:47,768 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 492 flow. Second operand 26 states and 512 transitions. [2025-03-04 02:20:47,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 399 transitions, 2468 flow [2025-03-04 02:20:47,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 399 transitions, 2379 flow, removed 23 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:47,906 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 738 flow [2025-03-04 02:20:47,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=738, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2025-03-04 02:20:47,907 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 69 predicate places. [2025-03-04 02:20:47,907 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 738 flow [2025-03-04 02:20:47,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:47,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:47,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:47,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:20:47,907 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:20:47,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash -897483074, now seen corresponding path program 2 times [2025-03-04 02:20:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:47,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914132804] [2025-03-04 02:20:47,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:47,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 02:20:47,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 48 statements. [2025-03-04 02:20:47,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:47,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914132804] [2025-03-04 02:20:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914132804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:20:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109173052] [2025-03-04 02:20:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:20:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:48,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:20:48,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:20:48,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-04 02:20:48,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 738 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:48,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:48,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-04 02:20:48,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:48,648 INFO L124 PetriNetUnfolderBase]: 5025/7377 cut-off events. [2025-03-04 02:20:48,648 INFO L125 PetriNetUnfolderBase]: For 37148/37272 co-relation queries the response was YES. [2025-03-04 02:20:48,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28579 conditions, 7377 events. 5025/7377 cut-off events. For 37148/37272 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 36340 event pairs, 1057 based on Foata normal form. 269/7637 useless extension candidates. Maximal degree in co-relation 28531. Up to 4117 conditions per place. [2025-03-04 02:20:48,693 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 154 selfloop transitions, 32 changer transitions 0/196 dead transitions. [2025-03-04 02:20:48,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 196 transitions, 1549 flow [2025-03-04 02:20:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-03-04 02:20:48,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3886363636363636 [2025-03-04 02:20:48,695 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 738 flow. Second operand 8 states and 171 transitions. [2025-03-04 02:20:48,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 196 transitions, 1549 flow [2025-03-04 02:20:48,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 196 transitions, 1453 flow, removed 25 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:48,762 INFO L231 Difference]: Finished difference. Result has 114 places, 120 transitions, 757 flow [2025-03-04 02:20:48,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=757, PETRI_PLACES=114, PETRI_TRANSITIONS=120} [2025-03-04 02:20:48,763 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2025-03-04 02:20:48,763 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 120 transitions, 757 flow [2025-03-04 02:20:48,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:48,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:48,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:48,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:20:48,764 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:20:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 916599256, now seen corresponding path program 1 times [2025-03-04 02:20:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890421610] [2025-03-04 02:20:48,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:48,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 02:20:48,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:20:48,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:48,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:49,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890421610] [2025-03-04 02:20:49,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890421610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:49,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:49,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:20:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871377264] [2025-03-04 02:20:49,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:49,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:20:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:49,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:20:49,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:49,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-04 02:20:49,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 120 transitions, 757 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:49,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:49,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-04 02:20:49,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:50,591 INFO L124 PetriNetUnfolderBase]: 7013/10228 cut-off events. [2025-03-04 02:20:50,591 INFO L125 PetriNetUnfolderBase]: For 53704/53725 co-relation queries the response was YES. [2025-03-04 02:20:50,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41279 conditions, 10228 events. 7013/10228 cut-off events. For 53704/53725 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 51484 event pairs, 823 based on Foata normal form. 9/10237 useless extension candidates. Maximal degree in co-relation 41205. Up to 4402 conditions per place. [2025-03-04 02:20:50,642 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 234 selfloop transitions, 77 changer transitions 128/441 dead transitions. [2025-03-04 02:20:50,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 441 transitions, 3392 flow [2025-03-04 02:20:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 02:20:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 02:20:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 571 transitions. [2025-03-04 02:20:50,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2805896805896806 [2025-03-04 02:20:50,644 INFO L175 Difference]: Start difference. First operand has 114 places, 120 transitions, 757 flow. Second operand 37 states and 571 transitions. [2025-03-04 02:20:50,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 441 transitions, 3392 flow [2025-03-04 02:20:50,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 441 transitions, 3292 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:50,748 INFO L231 Difference]: Finished difference. Result has 160 places, 151 transitions, 1229 flow [2025-03-04 02:20:50,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1229, PETRI_PLACES=160, PETRI_TRANSITIONS=151} [2025-03-04 02:20:50,749 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 104 predicate places. [2025-03-04 02:20:50,749 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 151 transitions, 1229 flow [2025-03-04 02:20:50,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:50,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:50,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:50,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:20:50,749 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:20:50,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash -53841748, now seen corresponding path program 2 times [2025-03-04 02:20:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:50,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806175200] [2025-03-04 02:20:50,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:50,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:20:50,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:20:50,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:50,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806175200] [2025-03-04 02:20:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806175200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:20:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300570509] [2025-03-04 02:20:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:50,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:50,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:50,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:50,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-04 02:20:51,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 151 transitions, 1229 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:20:51,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:51,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-04 02:20:51,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:52,868 INFO L124 PetriNetUnfolderBase]: 8939/13056 cut-off events. [2025-03-04 02:20:52,868 INFO L125 PetriNetUnfolderBase]: For 136733/136754 co-relation queries the response was YES. [2025-03-04 02:20:52,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59253 conditions, 13056 events. 8939/13056 cut-off events. For 136733/136754 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 68934 event pairs, 972 based on Foata normal form. 10/13066 useless extension candidates. Maximal degree in co-relation 59187. Up to 5071 conditions per place. [2025-03-04 02:20:52,928 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 306 selfloop transitions, 93 changer transitions 85/486 dead transitions. [2025-03-04 02:20:52,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 486 transitions, 4168 flow [2025-03-04 02:20:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 02:20:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 02:20:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 537 transitions. [2025-03-04 02:20:52,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32545454545454544 [2025-03-04 02:20:52,930 INFO L175 Difference]: Start difference. First operand has 160 places, 151 transitions, 1229 flow. Second operand 30 states and 537 transitions. [2025-03-04 02:20:52,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 486 transitions, 4168 flow [2025-03-04 02:20:53,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 486 transitions, 3892 flow, removed 84 selfloop flow, removed 18 redundant places. [2025-03-04 02:20:53,184 INFO L231 Difference]: Finished difference. Result has 177 places, 193 transitions, 1725 flow [2025-03-04 02:20:53,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1725, PETRI_PLACES=177, PETRI_TRANSITIONS=193} [2025-03-04 02:20:53,185 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 121 predicate places. [2025-03-04 02:20:53,185 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 193 transitions, 1725 flow [2025-03-04 02:20:53,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:20:53,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:53,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:53,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:20:53,186 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:20:53,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1082128320, now seen corresponding path program 3 times [2025-03-04 02:20:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942972310] [2025-03-04 02:20:53,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:53,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:20:53,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 48 of 49 statements. [2025-03-04 02:20:53,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:53,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:53,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942972310] [2025-03-04 02:20:53,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942972310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:53,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:53,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:20:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971331625] [2025-03-04 02:20:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:53,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:20:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:53,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:20:53,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:53,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-04 02:20:53,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 193 transitions, 1725 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:53,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:53,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-04 02:20:53,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:55,736 INFO L124 PetriNetUnfolderBase]: 10908/15927 cut-off events. [2025-03-04 02:20:55,737 INFO L125 PetriNetUnfolderBase]: For 243290/243311 co-relation queries the response was YES. [2025-03-04 02:20:55,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84074 conditions, 15927 events. 10908/15927 cut-off events. For 243290/243311 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 87490 event pairs, 1865 based on Foata normal form. 10/15937 useless extension candidates. Maximal degree in co-relation 83981. Up to 7699 conditions per place. [2025-03-04 02:20:55,834 INFO L140 encePairwiseOnDemand]: 37/55 looper letters, 321 selfloop transitions, 127 changer transitions 87/537 dead transitions. [2025-03-04 02:20:55,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 537 transitions, 5342 flow [2025-03-04 02:20:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 02:20:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 02:20:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 589 transitions. [2025-03-04 02:20:55,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29747474747474745 [2025-03-04 02:20:55,835 INFO L175 Difference]: Start difference. First operand has 177 places, 193 transitions, 1725 flow. Second operand 36 states and 589 transitions. [2025-03-04 02:20:55,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 537 transitions, 5342 flow [2025-03-04 02:20:56,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 537 transitions, 4941 flow, removed 160 selfloop flow, removed 16 redundant places. [2025-03-04 02:20:56,580 INFO L231 Difference]: Finished difference. Result has 205 places, 235 transitions, 2380 flow [2025-03-04 02:20:56,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2380, PETRI_PLACES=205, PETRI_TRANSITIONS=235} [2025-03-04 02:20:56,580 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 149 predicate places. [2025-03-04 02:20:56,580 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 235 transitions, 2380 flow [2025-03-04 02:20:56,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:56,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:56,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:56,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:20:56,581 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:20:56,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:56,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1385548776, now seen corresponding path program 4 times [2025-03-04 02:20:56,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:56,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110379810] [2025-03-04 02:20:56,582 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:56,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:56,589 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:20:56,596 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:20:56,596 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:56,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:56,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110379810] [2025-03-04 02:20:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110379810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:56,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:56,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:20:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531015064] [2025-03-04 02:20:56,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:56,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:56,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:56,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:56,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-04 02:20:56,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 235 transitions, 2380 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:20:56,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:56,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-04 02:20:56,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:59,949 INFO L124 PetriNetUnfolderBase]: 14852/21643 cut-off events. [2025-03-04 02:20:59,949 INFO L125 PetriNetUnfolderBase]: For 412610/412631 co-relation queries the response was YES. [2025-03-04 02:21:00,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123313 conditions, 21643 events. 14852/21643 cut-off events. For 412610/412631 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 125094 event pairs, 1635 based on Foata normal form. 15/21486 useless extension candidates. Maximal degree in co-relation 123216. Up to 8693 conditions per place. [2025-03-04 02:21:00,311 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 353 selfloop transitions, 208 changer transitions 192/755 dead transitions. [2025-03-04 02:21:00,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 755 transitions, 8453 flow [2025-03-04 02:21:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 02:21:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 02:21:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 678 transitions. [2025-03-04 02:21:00,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2801652892561983 [2025-03-04 02:21:00,313 INFO L175 Difference]: Start difference. First operand has 205 places, 235 transitions, 2380 flow. Second operand 44 states and 678 transitions. [2025-03-04 02:21:00,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 755 transitions, 8453 flow [2025-03-04 02:21:01,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 755 transitions, 7870 flow, removed 204 selfloop flow, removed 21 redundant places. [2025-03-04 02:21:01,565 INFO L231 Difference]: Finished difference. Result has 239 places, 336 transitions, 4103 flow [2025-03-04 02:21:01,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2168, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4103, PETRI_PLACES=239, PETRI_TRANSITIONS=336} [2025-03-04 02:21:01,565 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 183 predicate places. [2025-03-04 02:21:01,566 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 336 transitions, 4103 flow [2025-03-04 02:21:01,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:21:01,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:01,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:01,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:21:01,566 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:21:01,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash -982780672, now seen corresponding path program 5 times [2025-03-04 02:21:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:01,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386838087] [2025-03-04 02:21:01,567 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:01,572 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:21:01,582 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:21:01,582 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:01,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386838087] [2025-03-04 02:21:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386838087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122676855] [2025-03-04 02:21:01,768 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:01,770 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:21:01,771 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:21:01,819 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:21:01,839 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:21:01,839 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:01,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:01,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 02:21:01,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:02,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:21:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:02,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:02,245 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:21:02,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 02:21:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122676855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:02,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 25 [2025-03-04 02:21:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413346825] [2025-03-04 02:21:02,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 02:21:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:02,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 02:21:02,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:21:02,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-04 02:21:02,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 336 transitions, 4103 flow. Second operand has 25 states, 25 states have (on average 9.24) internal successors, (231), 25 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:21:02,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:02,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-04 02:21:02,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:07,479 INFO L124 PetriNetUnfolderBase]: 18546/27216 cut-off events. [2025-03-04 02:21:07,479 INFO L125 PetriNetUnfolderBase]: For 678728/678749 co-relation queries the response was YES. [2025-03-04 02:21:07,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161663 conditions, 27216 events. 18546/27216 cut-off events. For 678728/678749 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 167764 event pairs, 1068 based on Foata normal form. 18/27105 useless extension candidates. Maximal degree in co-relation 161559. Up to 10624 conditions per place. [2025-03-04 02:21:07,742 INFO L140 encePairwiseOnDemand]: 32/55 looper letters, 599 selfloop transitions, 317 changer transitions 151/1069 dead transitions. [2025-03-04 02:21:07,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 1069 transitions, 13559 flow [2025-03-04 02:21:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 02:21:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-03-04 02:21:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 847 transitions. [2025-03-04 02:21:07,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2655172413793103 [2025-03-04 02:21:07,744 INFO L175 Difference]: Start difference. First operand has 239 places, 336 transitions, 4103 flow. Second operand 58 states and 847 transitions. [2025-03-04 02:21:07,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 1069 transitions, 13559 flow [2025-03-04 02:21:11,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 1069 transitions, 12242 flow, removed 512 selfloop flow, removed 24 redundant places. [2025-03-04 02:21:11,869 INFO L231 Difference]: Finished difference. Result has 292 places, 553 transitions, 7571 flow [2025-03-04 02:21:11,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3604, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=7571, PETRI_PLACES=292, PETRI_TRANSITIONS=553} [2025-03-04 02:21:11,870 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 236 predicate places. [2025-03-04 02:21:11,870 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 553 transitions, 7571 flow [2025-03-04 02:21:11,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.24) internal successors, (231), 25 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:21:11,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:11,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:11,877 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:21:12,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:21:12,071 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:21:12,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1994090542, now seen corresponding path program 6 times [2025-03-04 02:21:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:12,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537864116] [2025-03-04 02:21:12,072 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:21:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:12,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:21:12,086 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 48 of 49 statements. [2025-03-04 02:21:12,086 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:21:12,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:12,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:12,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537864116] [2025-03-04 02:21:12,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537864116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:12,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:12,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:21:12,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939415887] [2025-03-04 02:21:12,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:12,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:21:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:12,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:21:12,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:21:12,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-04 02:21:12,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 553 transitions, 7571 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:12,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:12,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-04 02:21:12,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:16,547 INFO L124 PetriNetUnfolderBase]: 16505/24446 cut-off events. [2025-03-04 02:21:16,547 INFO L125 PetriNetUnfolderBase]: For 608258/608279 co-relation queries the response was YES. [2025-03-04 02:21:16,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156365 conditions, 24446 events. 16505/24446 cut-off events. For 608258/608279 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 150781 event pairs, 1889 based on Foata normal form. 9/24335 useless extension candidates. Maximal degree in co-relation 156245. Up to 15268 conditions per place. [2025-03-04 02:21:16,775 INFO L140 encePairwiseOnDemand]: 37/55 looper letters, 497 selfloop transitions, 236 changer transitions 62/797 dead transitions. [2025-03-04 02:21:16,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 797 transitions, 11494 flow [2025-03-04 02:21:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 02:21:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 02:21:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 423 transitions. [2025-03-04 02:21:16,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2958041958041958 [2025-03-04 02:21:16,777 INFO L175 Difference]: Start difference. First operand has 292 places, 553 transitions, 7571 flow. Second operand 26 states and 423 transitions. [2025-03-04 02:21:16,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 797 transitions, 11494 flow [2025-03-04 02:21:21,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 797 transitions, 11009 flow, removed 178 selfloop flow, removed 19 redundant places. [2025-03-04 02:21:21,236 INFO L231 Difference]: Finished difference. Result has 297 places, 582 transitions, 8370 flow [2025-03-04 02:21:21,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=7245, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=8370, PETRI_PLACES=297, PETRI_TRANSITIONS=582} [2025-03-04 02:21:21,236 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 241 predicate places. [2025-03-04 02:21:21,236 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 582 transitions, 8370 flow [2025-03-04 02:21:21,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:21,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:21,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:21,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:21:21,237 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:21:21,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1654479116, now seen corresponding path program 7 times [2025-03-04 02:21:21,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:21,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684738572] [2025-03-04 02:21:21,238 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:21:21,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:21,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 02:21:21,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:21:21,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:21,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:21,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684738572] [2025-03-04 02:21:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684738572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668813919] [2025-03-04 02:21:21,466 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:21:21,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:21,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:21,468 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:21:21,472 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:21:21,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 02:21:21,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:21:21,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:21,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:21:21,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:21,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:21:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:21,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:21,736 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:21:21,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 02:21:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668813919] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:21,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2025-03-04 02:21:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906104324] [2025-03-04 02:21:21,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:21,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:21:21,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:21,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:21:21,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:21:21,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-04 02:21:21,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 582 transitions, 8370 flow. Second operand has 20 states, 20 states have (on average 9.35) internal successors, (187), 20 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:21:21,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:21,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-04 02:21:21,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:27,960 INFO L124 PetriNetUnfolderBase]: 19072/28306 cut-off events. [2025-03-04 02:21:27,960 INFO L125 PetriNetUnfolderBase]: For 683186/683207 co-relation queries the response was YES. [2025-03-04 02:21:28,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179695 conditions, 28306 events. 19072/28306 cut-off events. For 683186/683207 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 178925 event pairs, 1077 based on Foata normal form. 10/28192 useless extension candidates. Maximal degree in co-relation 179579. Up to 9189 conditions per place. [2025-03-04 02:21:28,263 INFO L140 encePairwiseOnDemand]: 36/55 looper letters, 704 selfloop transitions, 644 changer transitions 150/1500 dead transitions. [2025-03-04 02:21:28,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1500 transitions, 21611 flow [2025-03-04 02:21:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-04 02:21:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2025-03-04 02:21:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 1073 transitions. [2025-03-04 02:21:28,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24386363636363637 [2025-03-04 02:21:28,266 INFO L175 Difference]: Start difference. First operand has 297 places, 582 transitions, 8370 flow. Second operand 80 states and 1073 transitions. [2025-03-04 02:21:28,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 1500 transitions, 21611 flow [2025-03-04 02:21:32,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 1500 transitions, 21053 flow, removed 147 selfloop flow, removed 19 redundant places. [2025-03-04 02:21:32,845 INFO L231 Difference]: Finished difference. Result has 375 places, 900 transitions, 14485 flow [2025-03-04 02:21:32,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=8109, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=14485, PETRI_PLACES=375, PETRI_TRANSITIONS=900} [2025-03-04 02:21:32,846 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 319 predicate places. [2025-03-04 02:21:32,846 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 900 transitions, 14485 flow [2025-03-04 02:21:32,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.35) internal successors, (187), 20 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:21:32,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:32,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:32,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:21:33,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:21:33,047 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:21:33,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash 174959184, now seen corresponding path program 2 times [2025-03-04 02:21:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:33,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250876133] [2025-03-04 02:21:33,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:21:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:33,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-04 02:21:33,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 52 statements. [2025-03-04 02:21:33,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:21:33,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250876133] [2025-03-04 02:21:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250876133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:21:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966139599] [2025-03-04 02:21:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:21:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:33,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:21:33,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:21:33,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-03-04 02:21:33,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 900 transitions, 14485 flow. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:21:33,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:33,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-03-04 02:21:33,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:40,685 INFO L124 PetriNetUnfolderBase]: 21133/31496 cut-off events. [2025-03-04 02:21:40,685 INFO L125 PetriNetUnfolderBase]: For 1021947/1022048 co-relation queries the response was YES. [2025-03-04 02:21:40,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226392 conditions, 31496 events. 21133/31496 cut-off events. For 1021947/1022048 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 204406 event pairs, 1598 based on Foata normal form. 56/31520 useless extension candidates. Maximal degree in co-relation 226259. Up to 21350 conditions per place. [2025-03-04 02:21:41,099 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 871 selfloop transitions, 281 changer transitions 71/1235 dead transitions. [2025-03-04 02:21:41,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1235 transitions, 21036 flow [2025-03-04 02:21:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:21:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:21:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 414 transitions. [2025-03-04 02:21:41,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2025-03-04 02:21:41,101 INFO L175 Difference]: Start difference. First operand has 375 places, 900 transitions, 14485 flow. Second operand 23 states and 414 transitions. [2025-03-04 02:21:41,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1235 transitions, 21036 flow [2025-03-04 02:21:51,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 1235 transitions, 19368 flow, removed 695 selfloop flow, removed 20 redundant places. [2025-03-04 02:21:51,557 INFO L231 Difference]: Finished difference. Result has 373 places, 969 transitions, 15237 flow [2025-03-04 02:21:51,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=13348, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=15237, PETRI_PLACES=373, PETRI_TRANSITIONS=969} [2025-03-04 02:21:51,558 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 317 predicate places. [2025-03-04 02:21:51,558 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 969 transitions, 15237 flow [2025-03-04 02:21:51,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:21:51,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:51,558 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:51,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:21:51,558 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:21:51,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1489815906, now seen corresponding path program 3 times [2025-03-04 02:21:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476169133] [2025-03-04 02:21:51,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:21:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:51,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-03-04 02:21:51,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 52 statements. [2025-03-04 02:21:51,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:21:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:21:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476169133] [2025-03-04 02:21:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476169133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:51,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:21:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619234048] [2025-03-04 02:21:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:51,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:21:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:51,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:21:51,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:21:51,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-04 02:21:51,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 969 transitions, 15237 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:51,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:51,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-04 02:21:51,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:56,406 INFO L124 PetriNetUnfolderBase]: 15814/23778 cut-off events. [2025-03-04 02:21:56,407 INFO L125 PetriNetUnfolderBase]: For 556237/556265 co-relation queries the response was YES. [2025-03-04 02:21:56,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154304 conditions, 23778 events. 15814/23778 cut-off events. For 556237/556265 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 150098 event pairs, 1642 based on Foata normal form. 293/24058 useless extension candidates. Maximal degree in co-relation 154175. Up to 18276 conditions per place. [2025-03-04 02:21:57,117 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 768 selfloop transitions, 133 changer transitions 0/924 dead transitions. [2025-03-04 02:21:57,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 924 transitions, 16499 flow [2025-03-04 02:21:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:21:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:21:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-03-04 02:21:57,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3795454545454545 [2025-03-04 02:21:57,118 INFO L175 Difference]: Start difference. First operand has 373 places, 969 transitions, 15237 flow. Second operand 8 states and 167 transitions. [2025-03-04 02:21:57,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 924 transitions, 16499 flow [2025-03-04 02:22:01,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 924 transitions, 16039 flow, removed 71 selfloop flow, removed 13 redundant places. [2025-03-04 02:22:01,526 INFO L231 Difference]: Finished difference. Result has 357 places, 839 transitions, 13344 flow [2025-03-04 02:22:01,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=12904, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13344, PETRI_PLACES=357, PETRI_TRANSITIONS=839} [2025-03-04 02:22:01,527 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 301 predicate places. [2025-03-04 02:22:01,527 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 839 transitions, 13344 flow [2025-03-04 02:22:01,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:01,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:01,527 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:01,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:22:01,527 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:22:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash 272055541, now seen corresponding path program 8 times [2025-03-04 02:22:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820147581] [2025-03-04 02:22:01,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:01,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-04 02:22:01,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:22:01,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:01,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820147581] [2025-03-04 02:22:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820147581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601594370] [2025-03-04 02:22:01,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:01,603 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:22:01,604 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:22:01,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-04 02:22:01,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:22:01,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:01,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:01,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:01,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:01,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601594370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:01,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:01,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 02:22:01,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374108674] [2025-03-04 02:22:01,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:01,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:22:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:01,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:22:01,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:22:01,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-04 02:22:01,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 839 transitions, 13344 flow. Second operand has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 11 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:01,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:01,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-04 02:22:01,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand