./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:04:31,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:04:31,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:04:31,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:04:31,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:04:31,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:04:31,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:04:31,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:04:31,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:04:31,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:04:31,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:04:31,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:04:31,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:04:31,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:04:31,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:04:31,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:04:31,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:04:31,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:04:31,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:04:31,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:04:31,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:04:31,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:04:31,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:04:31,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:04:31,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:04:31,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:04:31,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:04:31,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:04:31,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:04:31,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:04:31,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:04:31,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:04:31,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:04:31,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:04:31,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:04:31,240 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-03-14 01:04:31,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:04:31,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:04:31,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:04:31,461 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:04:31,461 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:04:31,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-14 01:04:32,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fc3cb4c/0ad2936ecb5d47ff8fd9341dafae18c0/FLAGcae11fe12 [2025-03-14 01:04:32,823 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:04:32,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-14 01:04:32,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fc3cb4c/0ad2936ecb5d47ff8fd9341dafae18c0/FLAGcae11fe12 [2025-03-14 01:04:32,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fc3cb4c/0ad2936ecb5d47ff8fd9341dafae18c0 [2025-03-14 01:04:32,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:04:32,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:04:32,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:04:32,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:04:32,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:04:32,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:32,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c442006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32, skipping insertion in model container [2025-03-14 01:04:32,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:32,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:04:32,955 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-ticket-4.wvr.c[2554,2567] [2025-03-14 01:04:32,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:04:32,966 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:04:32,981 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-ticket-4.wvr.c[2554,2567] [2025-03-14 01:04:32,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:04:32,991 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:04:32,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32 WrapperNode [2025-03-14 01:04:32,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:04:32,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:04:32,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:04:32,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:04:32,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,018 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-14 01:04:33,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:04:33,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:04:33,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:04:33,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:04:33,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,050 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-14 01:04:33,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:04:33,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:04:33,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:04:33,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:04:33,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (1/1) ... [2025-03-14 01:04:33,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:04:33,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:33,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:04:33,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:04:33,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:04:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:04:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:04:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:04:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:04:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:04:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:04:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:04:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:04:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:04:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:04:33,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:04:33,117 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:04:33,188 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:04:33,189 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:04:33,418 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:04:33,419 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:04:33,419 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:04:33,565 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:04:33,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:04:33 BoogieIcfgContainer [2025-03-14 01:04:33,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:04:33,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:04:33,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:04:33,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:04:33,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:04:32" (1/3) ... [2025-03-14 01:04:33,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33954bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:04:33, skipping insertion in model container [2025-03-14 01:04:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:32" (2/3) ... [2025-03-14 01:04:33,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33954bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:04:33, skipping insertion in model container [2025-03-14 01:04:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:04:33" (3/3) ... [2025-03-14 01:04:33,573 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-03-14 01:04:33,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:04:33,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 57 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 01:04:33,585 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:04:33,641 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:04:33,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2025-03-14 01:04:33,719 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2025-03-14 01:04:33,721 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:04:33,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 3/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-14 01:04:33,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2025-03-14 01:04:33,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2025-03-14 01:04:33,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:04:33,763 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;@1cc712c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:04:33,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 01:04:33,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:04:33,783 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-03-14 01:04:33,784 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:04:33,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:33,784 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-14 01:04:33,785 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 2 more)] === [2025-03-14 01:04:33,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:33,790 INFO L85 PathProgramCache]: Analyzing trace with hash 91534751, now seen corresponding path program 1 times [2025-03-14 01:04:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25063503] [2025-03-14 01:04:33,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:33,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:04:33,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:04:33,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:33,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:34,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:34,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25063503] [2025-03-14 01:04:34,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25063503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:04:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224692579] [2025-03-14 01:04:34,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:34,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:04:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:34,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:04:34,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:04:34,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:04:34,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:34,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:34,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:04:34,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:35,765 INFO L124 PetriNetUnfolderBase]: 17631/24113 cut-off events. [2025-03-14 01:04:35,766 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2025-03-14 01:04:35,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48642 conditions, 24113 events. 17631/24113 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 139193 event pairs, 6173 based on Foata normal form. 1/23348 useless extension candidates. Maximal degree in co-relation 45351. Up to 14774 conditions per place. [2025-03-14 01:04:35,969 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 66 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2025-03-14 01:04:35,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 356 flow [2025-03-14 01:04:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:04:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:04:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-14 01:04:35,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-03-14 01:04:35,983 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 119 transitions. [2025-03-14 01:04:35,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 356 flow [2025-03-14 01:04:36,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:04:36,017 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-03-14 01:04:36,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-14 01:04:36,021 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-03-14 01:04:36,021 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-03-14 01:04:36,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:36,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:36,022 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-14 01:04:36,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:04:36,022 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 2 more)] === [2025-03-14 01:04:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1023503031, now seen corresponding path program 1 times [2025-03-14 01:04:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140308208] [2025-03-14 01:04:36,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:36,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:36,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:36,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:36,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:36,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140308208] [2025-03-14 01:04:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140308208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:36,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:36,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:04:36,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135298037] [2025-03-14 01:04:36,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:36,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:04:36,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:36,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:04:36,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:04:36,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:04:36,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:36,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:36,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:04:36,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:38,734 INFO L124 PetriNetUnfolderBase]: 37141/53406 cut-off events. [2025-03-14 01:04:38,735 INFO L125 PetriNetUnfolderBase]: For 6178/6178 co-relation queries the response was YES. [2025-03-14 01:04:38,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112069 conditions, 53406 events. 37141/53406 cut-off events. For 6178/6178 co-relation queries the response was YES. Maximal size of possible extension queue 2202. Compared 373035 event pairs, 9960 based on Foata normal form. 751/52213 useless extension candidates. Maximal degree in co-relation 40621. Up to 17109 conditions per place. [2025-03-14 01:04:39,136 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 119 selfloop transitions, 19 changer transitions 0/149 dead transitions. [2025-03-14 01:04:39,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 149 transitions, 665 flow [2025-03-14 01:04:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:04:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:04:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-03-14 01:04:39,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.688135593220339 [2025-03-14 01:04:39,140 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 5 states and 203 transitions. [2025-03-14 01:04:39,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 149 transitions, 665 flow [2025-03-14 01:04:39,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 149 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:04:39,153 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 252 flow [2025-03-14 01:04:39,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2025-03-14 01:04:39,154 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2025-03-14 01:04:39,154 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 252 flow [2025-03-14 01:04:39,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:39,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:39,154 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-14 01:04:39,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:04:39,155 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 2 more)] === [2025-03-14 01:04:39,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash 205774361, now seen corresponding path program 2 times [2025-03-14 01:04:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494671181] [2025-03-14 01:04:39,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:04:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:39,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:39,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:39,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:04:39,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:39,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494671181] [2025-03-14 01:04:39,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494671181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:39,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:04:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584453395] [2025-03-14 01:04:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:39,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:04:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:39,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:04:39,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:04:39,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-03-14 01:04:39,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:39,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:39,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-03-14 01:04:39,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:41,398 INFO L124 PetriNetUnfolderBase]: 33558/47690 cut-off events. [2025-03-14 01:04:41,399 INFO L125 PetriNetUnfolderBase]: For 26000/26046 co-relation queries the response was YES. [2025-03-14 01:04:41,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121102 conditions, 47690 events. 33558/47690 cut-off events. For 26000/26046 co-relation queries the response was YES. Maximal size of possible extension queue 1939. Compared 324950 event pairs, 19143 based on Foata normal form. 4685/51989 useless extension candidates. Maximal degree in co-relation 62474. Up to 38443 conditions per place. [2025-03-14 01:04:41,573 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 97 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-14 01:04:41,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 597 flow [2025-03-14 01:04:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:04:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:04:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-14 01:04:41,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6045197740112994 [2025-03-14 01:04:41,577 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 252 flow. Second operand 3 states and 107 transitions. [2025-03-14 01:04:41,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 597 flow [2025-03-14 01:04:41,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 110 transitions, 597 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:04:41,584 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 273 flow [2025-03-14 01:04:41,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2025-03-14 01:04:41,585 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2025-03-14 01:04:41,585 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 273 flow [2025-03-14 01:04:41,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:41,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:41,586 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-14 01:04:41,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:04:41,586 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 2 more)] === [2025-03-14 01:04:41,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash -149089447, now seen corresponding path program 1 times [2025-03-14 01:04:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929842267] [2025-03-14 01:04:41,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:41,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:41,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:41,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:41,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:41,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:41,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929842267] [2025-03-14 01:04:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929842267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:41,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:41,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:04:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216479194] [2025-03-14 01:04:41,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:04:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:41,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:04:41,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:04:41,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:04:41,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:41,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:41,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:04:41,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:44,056 INFO L124 PetriNetUnfolderBase]: 31674/46277 cut-off events. [2025-03-14 01:04:44,056 INFO L125 PetriNetUnfolderBase]: For 30065/30095 co-relation queries the response was YES. [2025-03-14 01:04:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120096 conditions, 46277 events. 31674/46277 cut-off events. For 30065/30095 co-relation queries the response was YES. Maximal size of possible extension queue 1920. Compared 328086 event pairs, 8273 based on Foata normal form. 548/46492 useless extension candidates. Maximal degree in co-relation 64535. Up to 15584 conditions per place. [2025-03-14 01:04:44,262 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 24 changer transitions 3/150 dead transitions. [2025-03-14 01:04:44,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 150 transitions, 805 flow [2025-03-14 01:04:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:04:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:04:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-03-14 01:04:44,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6745762711864407 [2025-03-14 01:04:44,264 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 273 flow. Second operand 5 states and 199 transitions. [2025-03-14 01:04:44,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 150 transitions, 805 flow [2025-03-14 01:04:44,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 150 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:04:44,302 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 364 flow [2025-03-14 01:04:44,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2025-03-14 01:04:44,302 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2025-03-14 01:04:44,302 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 364 flow [2025-03-14 01:04:44,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:44,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:44,303 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-14 01:04:44,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:04:44,303 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 2 more)] === [2025-03-14 01:04:44,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash -260426727, now seen corresponding path program 2 times [2025-03-14 01:04:44,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:44,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288430593] [2025-03-14 01:04:44,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:04:44,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:44,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:44,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:44,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:04:44,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288430593] [2025-03-14 01:04:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288430593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:44,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:04:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576669467] [2025-03-14 01:04:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:44,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:04:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:44,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:04:44,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:04:44,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:04:44,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:44,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:44,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:04:44,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:46,919 INFO L124 PetriNetUnfolderBase]: 31731/47375 cut-off events. [2025-03-14 01:04:46,919 INFO L125 PetriNetUnfolderBase]: For 43137/43151 co-relation queries the response was YES. [2025-03-14 01:04:47,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129960 conditions, 47375 events. 31731/47375 cut-off events. For 43137/43151 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 348653 event pairs, 6398 based on Foata normal form. 328/47331 useless extension candidates. Maximal degree in co-relation 81956. Up to 18586 conditions per place. [2025-03-14 01:04:47,120 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 130 selfloop transitions, 61 changer transitions 7/209 dead transitions. [2025-03-14 01:04:47,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 209 transitions, 1270 flow [2025-03-14 01:04:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:04:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:04:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2025-03-14 01:04:47,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6751412429378532 [2025-03-14 01:04:47,121 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 364 flow. Second operand 6 states and 239 transitions. [2025-03-14 01:04:47,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 209 transitions, 1270 flow [2025-03-14 01:04:47,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 209 transitions, 1224 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:04:47,147 INFO L231 Difference]: Finished difference. Result has 77 places, 116 transitions, 773 flow [2025-03-14 01:04:47,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=773, PETRI_PLACES=77, PETRI_TRANSITIONS=116} [2025-03-14 01:04:47,148 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2025-03-14 01:04:47,148 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 116 transitions, 773 flow [2025-03-14 01:04:47,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:47,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:47,148 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-14 01:04:47,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:04:47,149 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 2 more)] === [2025-03-14 01:04:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2058507545, now seen corresponding path program 3 times [2025-03-14 01:04:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738453319] [2025-03-14 01:04:47,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:04:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:47,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:47,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:47,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:04:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738453319] [2025-03-14 01:04:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738453319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:47,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:47,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:04:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847150613] [2025-03-14 01:04:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:47,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:04:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:47,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:04:47,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:04:47,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2025-03-14 01:04:47,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 116 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:47,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:47,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2025-03-14 01:04:47,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:50,403 INFO L124 PetriNetUnfolderBase]: 42584/60097 cut-off events. [2025-03-14 01:04:50,403 INFO L125 PetriNetUnfolderBase]: For 97660/97670 co-relation queries the response was YES. [2025-03-14 01:04:50,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183013 conditions, 60097 events. 42584/60097 cut-off events. For 97660/97670 co-relation queries the response was YES. Maximal size of possible extension queue 2180. Compared 402185 event pairs, 26316 based on Foata normal form. 632/60715 useless extension candidates. Maximal degree in co-relation 124377. Up to 52328 conditions per place. [2025-03-14 01:04:50,677 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 162 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-03-14 01:04:50,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 169 transitions, 1457 flow [2025-03-14 01:04:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:04:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:04:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-14 01:04:50,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5706214689265536 [2025-03-14 01:04:50,678 INFO L175 Difference]: Start difference. First operand has 77 places, 116 transitions, 773 flow. Second operand 3 states and 101 transitions. [2025-03-14 01:04:50,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 169 transitions, 1457 flow [2025-03-14 01:04:50,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 169 transitions, 1441 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-14 01:04:50,788 INFO L231 Difference]: Finished difference. Result has 80 places, 116 transitions, 771 flow [2025-03-14 01:04:50,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=80, PETRI_TRANSITIONS=116} [2025-03-14 01:04:50,791 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places. [2025-03-14 01:04:50,791 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 116 transitions, 771 flow [2025-03-14 01:04:50,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:50,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:50,791 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-14 01:04:50,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:04:50,792 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 2 more)] === [2025-03-14 01:04:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:50,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1222303837, now seen corresponding path program 4 times [2025-03-14 01:04:50,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:50,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401235269] [2025-03-14 01:04:50,793 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:04:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:50,802 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:04:50,815 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:50,815 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:04:50,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401235269] [2025-03-14 01:04:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401235269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:50,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:04:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536309452] [2025-03-14 01:04:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:50,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:04:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:50,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:04:50,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:04:50,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:04:50,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 116 transitions, 771 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:50,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:50,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:04:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:53,659 INFO L124 PetriNetUnfolderBase]: 30620/45663 cut-off events. [2025-03-14 01:04:53,659 INFO L125 PetriNetUnfolderBase]: For 90393/90435 co-relation queries the response was YES. [2025-03-14 01:04:53,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148110 conditions, 45663 events. 30620/45663 cut-off events. For 90393/90435 co-relation queries the response was YES. Maximal size of possible extension queue 1901. Compared 333734 event pairs, 8399 based on Foata normal form. 376/45436 useless extension candidates. Maximal degree in co-relation 104430. Up to 21077 conditions per place. [2025-03-14 01:04:53,892 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 127 selfloop transitions, 47 changer transitions 12/197 dead transitions. [2025-03-14 01:04:53,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 197 transitions, 1526 flow [2025-03-14 01:04:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:04:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:04:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-03-14 01:04:53,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6711864406779661 [2025-03-14 01:04:53,893 INFO L175 Difference]: Start difference. First operand has 80 places, 116 transitions, 771 flow. Second operand 5 states and 198 transitions. [2025-03-14 01:04:53,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 197 transitions, 1526 flow [2025-03-14 01:04:54,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 197 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:04:54,065 INFO L231 Difference]: Finished difference. Result has 84 places, 125 transitions, 998 flow [2025-03-14 01:04:54,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=998, PETRI_PLACES=84, PETRI_TRANSITIONS=125} [2025-03-14 01:04:54,066 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 20 predicate places. [2025-03-14 01:04:54,066 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 125 transitions, 998 flow [2025-03-14 01:04:54,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:54,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:54,066 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-14 01:04:54,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:04:54,067 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 2 more)] === [2025-03-14 01:04:54,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1537861743, now seen corresponding path program 5 times [2025-03-14 01:04:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650228983] [2025-03-14 01:04:54,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:04:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:54,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:54,079 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:54,080 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:04:54,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:54,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650228983] [2025-03-14 01:04:54,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650228983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:54,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:04:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687854715] [2025-03-14 01:04:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:04:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:54,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:04:54,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:04:54,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:04:54,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 125 transitions, 998 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:54,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:54,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:04:54,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:56,875 INFO L124 PetriNetUnfolderBase]: 26488/39153 cut-off events. [2025-03-14 01:04:56,876 INFO L125 PetriNetUnfolderBase]: For 91625/91753 co-relation queries the response was YES. [2025-03-14 01:04:56,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132854 conditions, 39153 events. 26488/39153 cut-off events. For 91625/91753 co-relation queries the response was YES. Maximal size of possible extension queue 1769. Compared 276943 event pairs, 6061 based on Foata normal form. 442/38900 useless extension candidates. Maximal degree in co-relation 91009. Up to 14975 conditions per place. [2025-03-14 01:04:57,075 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 129 selfloop transitions, 72 changer transitions 10/222 dead transitions. [2025-03-14 01:04:57,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 222 transitions, 1833 flow [2025-03-14 01:04:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:04:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:04:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2025-03-14 01:04:57,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-03-14 01:04:57,076 INFO L175 Difference]: Start difference. First operand has 84 places, 125 transitions, 998 flow. Second operand 6 states and 238 transitions. [2025-03-14 01:04:57,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 222 transitions, 1833 flow [2025-03-14 01:04:57,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 222 transitions, 1770 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:04:57,136 INFO L231 Difference]: Finished difference. Result has 88 places, 128 transitions, 1153 flow [2025-03-14 01:04:57,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1153, PETRI_PLACES=88, PETRI_TRANSITIONS=128} [2025-03-14 01:04:57,137 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 24 predicate places. [2025-03-14 01:04:57,137 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 128 transitions, 1153 flow [2025-03-14 01:04:57,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:57,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:57,137 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-14 01:04:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:04:57,137 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 2 more)] === [2025-03-14 01:04:57,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash 199475961, now seen corresponding path program 6 times [2025-03-14 01:04:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:57,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527042328] [2025-03-14 01:04:57,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:04:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:57,148 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:57,153 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:57,153 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:04:57,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527042328] [2025-03-14 01:04:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527042328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:04:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83984885] [2025-03-14 01:04:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:57,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:04:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:57,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:04:57,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:04:57,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:04:57,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 128 transitions, 1153 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:57,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:57,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:04:57,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:00,200 INFO L124 PetriNetUnfolderBase]: 26979/40212 cut-off events. [2025-03-14 01:05:00,200 INFO L125 PetriNetUnfolderBase]: For 121571/121681 co-relation queries the response was YES. [2025-03-14 01:05:00,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142961 conditions, 40212 events. 26979/40212 cut-off events. For 121571/121681 co-relation queries the response was YES. Maximal size of possible extension queue 1803. Compared 288760 event pairs, 6602 based on Foata normal form. 445/39984 useless extension candidates. Maximal degree in co-relation 98491. Up to 14937 conditions per place. [2025-03-14 01:05:00,393 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 155 selfloop transitions, 91 changer transitions 3/260 dead transitions. [2025-03-14 01:05:00,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 260 transitions, 2327 flow [2025-03-14 01:05:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:05:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:05:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 304 transitions. [2025-03-14 01:05:00,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2025-03-14 01:05:00,394 INFO L175 Difference]: Start difference. First operand has 88 places, 128 transitions, 1153 flow. Second operand 8 states and 304 transitions. [2025-03-14 01:05:00,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 260 transitions, 2327 flow [2025-03-14 01:05:00,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 260 transitions, 2138 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-14 01:05:00,499 INFO L231 Difference]: Finished difference. Result has 92 places, 147 transitions, 1468 flow [2025-03-14 01:05:00,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1468, PETRI_PLACES=92, PETRI_TRANSITIONS=147} [2025-03-14 01:05:00,500 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 28 predicate places. [2025-03-14 01:05:00,500 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 147 transitions, 1468 flow [2025-03-14 01:05:00,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:00,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:00,500 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-14 01:05:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:05:00,500 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 2 more)] === [2025-03-14 01:05:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1157453703, now seen corresponding path program 1 times [2025-03-14 01:05:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534957710] [2025-03-14 01:05:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:00,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:05:00,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:05:00,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:00,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:00,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:00,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534957710] [2025-03-14 01:05:00,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534957710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:00,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:00,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:05:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773759444] [2025-03-14 01:05:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:00,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:05:00,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:00,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:05:00,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:05:00,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:05:00,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 147 transitions, 1468 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:00,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:00,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:05:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:02,906 INFO L124 PetriNetUnfolderBase]: 23855/35954 cut-off events. [2025-03-14 01:05:02,907 INFO L125 PetriNetUnfolderBase]: For 107750/107824 co-relation queries the response was YES. [2025-03-14 01:05:03,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128645 conditions, 35954 events. 23855/35954 cut-off events. For 107750/107824 co-relation queries the response was YES. Maximal size of possible extension queue 1620. Compared 259171 event pairs, 5913 based on Foata normal form. 726/36103 useless extension candidates. Maximal degree in co-relation 92156. Up to 13480 conditions per place. [2025-03-14 01:05:03,087 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 150 selfloop transitions, 98 changer transitions 26/285 dead transitions. [2025-03-14 01:05:03,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 285 transitions, 2740 flow [2025-03-14 01:05:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:05:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:05:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 308 transitions. [2025-03-14 01:05:03,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.652542372881356 [2025-03-14 01:05:03,088 INFO L175 Difference]: Start difference. First operand has 92 places, 147 transitions, 1468 flow. Second operand 8 states and 308 transitions. [2025-03-14 01:05:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 285 transitions, 2740 flow [2025-03-14 01:05:03,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 285 transitions, 2597 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:05:03,192 INFO L231 Difference]: Finished difference. Result has 98 places, 154 transitions, 1662 flow [2025-03-14 01:05:03,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1662, PETRI_PLACES=98, PETRI_TRANSITIONS=154} [2025-03-14 01:05:03,193 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 34 predicate places. [2025-03-14 01:05:03,193 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 154 transitions, 1662 flow [2025-03-14 01:05:03,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:03,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:03,193 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-14 01:05:03,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:05:03,193 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 2 more)] === [2025-03-14 01:05:03,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:03,194 INFO L85 PathProgramCache]: Analyzing trace with hash 7855941, now seen corresponding path program 7 times [2025-03-14 01:05:03,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:03,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060329917] [2025-03-14 01:05:03,194 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:05:03,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:03,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:05:03,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:05:03,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:03,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060329917] [2025-03-14 01:05:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060329917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:03,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:03,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:05:03,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028919233] [2025-03-14 01:05:03,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:03,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:05:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:03,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:05:03,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:05:03,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:05:03,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 154 transitions, 1662 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:03,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:03,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:05:03,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:05,653 INFO L124 PetriNetUnfolderBase]: 17502/26968 cut-off events. [2025-03-14 01:05:05,654 INFO L125 PetriNetUnfolderBase]: For 87000/87068 co-relation queries the response was YES. [2025-03-14 01:05:05,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97801 conditions, 26968 events. 17502/26968 cut-off events. For 87000/87068 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 191622 event pairs, 4571 based on Foata normal form. 276/26934 useless extension candidates. Maximal degree in co-relation 75860. Up to 9875 conditions per place. [2025-03-14 01:05:05,817 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 131 selfloop transitions, 108 changer transitions 26/276 dead transitions. [2025-03-14 01:05:05,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 276 transitions, 2970 flow [2025-03-14 01:05:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:05:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:05:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2025-03-14 01:05:05,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6207627118644068 [2025-03-14 01:05:05,819 INFO L175 Difference]: Start difference. First operand has 98 places, 154 transitions, 1662 flow. Second operand 8 states and 293 transitions. [2025-03-14 01:05:05,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 276 transitions, 2970 flow [2025-03-14 01:05:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 276 transitions, 2925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:05:05,904 INFO L231 Difference]: Finished difference. Result has 105 places, 162 transitions, 2012 flow [2025-03-14 01:05:05,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2012, PETRI_PLACES=105, PETRI_TRANSITIONS=162} [2025-03-14 01:05:05,905 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 41 predicate places. [2025-03-14 01:05:05,905 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 162 transitions, 2012 flow [2025-03-14 01:05:05,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:05,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:05,905 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-14 01:05:05,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:05:05,905 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 2 more)] === [2025-03-14 01:05:05,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1443681723, now seen corresponding path program 8 times [2025-03-14 01:05:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142922926] [2025-03-14 01:05:05,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:05,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:05,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:05:05,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:05:05,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:05:05,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:05,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:05,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142922926] [2025-03-14 01:05:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142922926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:05,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:05,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:05:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682585280] [2025-03-14 01:05:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:05,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:05:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:05,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:05:06,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:05:06,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:05:06,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 162 transitions, 2012 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:06,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:06,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:05:06,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:08,140 INFO L124 PetriNetUnfolderBase]: 16928/26148 cut-off events. [2025-03-14 01:05:08,141 INFO L125 PetriNetUnfolderBase]: For 99501/99517 co-relation queries the response was YES. [2025-03-14 01:05:08,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96268 conditions, 26148 events. 16928/26148 cut-off events. For 99501/99517 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 185822 event pairs, 4421 based on Foata normal form. 64/25894 useless extension candidates. Maximal degree in co-relation 73022. Up to 9962 conditions per place. [2025-03-14 01:05:08,263 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 113 selfloop transitions, 140 changer transitions 16/280 dead transitions. [2025-03-14 01:05:08,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 280 transitions, 3294 flow [2025-03-14 01:05:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:05:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:05:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2025-03-14 01:05:08,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.586864406779661 [2025-03-14 01:05:08,264 INFO L175 Difference]: Start difference. First operand has 105 places, 162 transitions, 2012 flow. Second operand 8 states and 277 transitions. [2025-03-14 01:05:08,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 280 transitions, 3294 flow [2025-03-14 01:05:08,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 280 transitions, 3235 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:05:08,386 INFO L231 Difference]: Finished difference. Result has 111 places, 188 transitions, 2592 flow [2025-03-14 01:05:08,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2592, PETRI_PLACES=111, PETRI_TRANSITIONS=188} [2025-03-14 01:05:08,387 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 47 predicate places. [2025-03-14 01:05:08,387 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 188 transitions, 2592 flow [2025-03-14 01:05:08,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:08,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:08,387 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-14 01:05:08,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:05:08,388 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 2 more)] === [2025-03-14 01:05:08,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1520137715, now seen corresponding path program 9 times [2025-03-14 01:05:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:08,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671244651] [2025-03-14 01:05:08,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:05:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:08,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:05:08,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:05:08,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:05:08,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671244651] [2025-03-14 01:05:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671244651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:08,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:05:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863386822] [2025-03-14 01:05:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:08,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:05:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:08,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:05:08,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:05:08,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:05:08,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 188 transitions, 2592 flow. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:08,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:08,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:05:08,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:10,852 INFO L124 PetriNetUnfolderBase]: 15936/24602 cut-off events. [2025-03-14 01:05:10,852 INFO L125 PetriNetUnfolderBase]: For 117623/117635 co-relation queries the response was YES. [2025-03-14 01:05:10,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93161 conditions, 24602 events. 15936/24602 cut-off events. For 117623/117635 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 173637 event pairs, 4169 based on Foata normal form. 282/24546 useless extension candidates. Maximal degree in co-relation 69622. Up to 9172 conditions per place. [2025-03-14 01:05:10,959 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 148 selfloop transitions, 146 changer transitions 23/328 dead transitions. [2025-03-14 01:05:10,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 328 transitions, 3991 flow [2025-03-14 01:05:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:05:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:05:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 388 transitions. [2025-03-14 01:05:10,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5480225988700564 [2025-03-14 01:05:10,960 INFO L175 Difference]: Start difference. First operand has 111 places, 188 transitions, 2592 flow. Second operand 12 states and 388 transitions. [2025-03-14 01:05:10,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 328 transitions, 3991 flow [2025-03-14 01:05:11,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 328 transitions, 3754 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-03-14 01:05:11,075 INFO L231 Difference]: Finished difference. Result has 119 places, 194 transitions, 2765 flow [2025-03-14 01:05:11,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2765, PETRI_PLACES=119, PETRI_TRANSITIONS=194} [2025-03-14 01:05:11,076 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 55 predicate places. [2025-03-14 01:05:11,077 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 194 transitions, 2765 flow [2025-03-14 01:05:11,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:11,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:11,077 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-14 01:05:11,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:05:11,077 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 2 more)] === [2025-03-14 01:05:11,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -137170547, now seen corresponding path program 10 times [2025-03-14 01:05:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:11,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204947320] [2025-03-14 01:05:11,078 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:05:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:11,086 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:05:11,091 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:05:11,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:05:11,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:11,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204947320] [2025-03-14 01:05:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204947320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:11,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:05:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515308] [2025-03-14 01:05:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:11,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:05:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:11,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:05:11,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:05:11,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-14 01:05:11,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 194 transitions, 2765 flow. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:11,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:11,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-14 01:05:11,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand