./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.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 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:49:18,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:49:18,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:49:18,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:49:18,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:49:18,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:49:18,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:49:18,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:49:18,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:49:18,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:49:18,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:49:18,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:49:18,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:49:18,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:49:18,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:49:18,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:49:18,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:49:18,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:49:18,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:49:18,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:18,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:49:18,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:49:18,496 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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-03-13 21:49:18,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:49:18,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:49:18,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:49:18,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:49:18,726 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:49:18,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-13 21:49:19,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcff016d0/f9a6a3b447384fc89fa50b562bb111ad/FLAG5665e42e0 [2025-03-13 21:49:20,048 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:49:20,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-13 21:49:20,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcff016d0/f9a6a3b447384fc89fa50b562bb111ad/FLAG5665e42e0 [2025-03-13 21:49:20,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcff016d0/f9a6a3b447384fc89fa50b562bb111ad [2025-03-13 21:49:20,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:49:20,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:49:20,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:20,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:49:20,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:49:20,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394efba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20, skipping insertion in model container [2025-03-13 21:49:20,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:49:20,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c[2896,2909] [2025-03-13 21:49:20,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:20,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:49:20,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c[2896,2909] [2025-03-13 21:49:20,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:20,289 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:49:20,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20 WrapperNode [2025-03-13 21:49:20,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:20,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:20,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:49:20,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:49:20,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,318 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2025-03-13 21:49:20,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:20,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:49:20,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:49:20,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:49:20,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,346 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-13 21:49:20,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:49:20,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:49:20,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:49:20,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:49:20,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:20,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:20,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:49:20,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:49:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:49:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:49:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:49:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:49:20,409 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:49:20,476 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:49:20,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:49:20,725 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:49:20,726 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:49:20,726 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:49:20,922 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:49:20,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:20 BoogieIcfgContainer [2025-03-13 21:49:20,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:49:20,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:49:20,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:49:20,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:49:20,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:49:20" (1/3) ... [2025-03-13 21:49:20,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594a85ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:20, skipping insertion in model container [2025-03-13 21:49:20,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20" (2/3) ... [2025-03-13 21:49:20,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594a85ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:20, skipping insertion in model container [2025-03-13 21:49:20,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:20" (3/3) ... [2025-03-13 21:49:20,931 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-03-13 21:49:20,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:49:20,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:49:20,944 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:49:20,997 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:49:21,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-03-13 21:49:21,047 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-13 21:49:21,048 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:49:21,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-13 21:49:21,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-03-13 21:49:21,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-03-13 21:49:21,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:49:21,072 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;@6c86744b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:49:21,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:49:21,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:49:21,084 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-13 21:49:21,084 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:49:21,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:21,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:21,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 750824110, now seen corresponding path program 1 times [2025-03-13 21:49:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473543406] [2025-03-13 21:49:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:21,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:49:21,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:49:21,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:21,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473543406] [2025-03-13 21:49:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473543406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947412532] [2025-03-13 21:49:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:21,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:49:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:21,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:49:21,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:49:21,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-13 21:49:21,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:21,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:21,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-13 21:49:21,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:21,378 INFO L124 PetriNetUnfolderBase]: 108/203 cut-off events. [2025-03-13 21:49:21,378 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-13 21:49:21,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 203 events. 108/203 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 623 event pairs, 83 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 361. Up to 178 conditions per place. [2025-03-13 21:49:21,386 INFO L140 encePairwiseOnDemand]: 27/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-03-13 21:49:21,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 100 flow [2025-03-13 21:49:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:49:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:49:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2025-03-13 21:49:21,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-13 21:49:21,400 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 2 states and 33 transitions. [2025-03-13 21:49:21,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 100 flow [2025-03-13 21:49:21,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:21,406 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 52 flow [2025-03-13 21:49:21,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-03-13 21:49:21,410 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-03-13 21:49:21,410 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 52 flow [2025-03-13 21:49:21,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:21,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:21,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:21,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:49:21,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:21,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:21,413 INFO L85 PathProgramCache]: Analyzing trace with hash 733356482, now seen corresponding path program 1 times [2025-03-13 21:49:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:21,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642101546] [2025-03-13 21:49:21,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:21,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:21,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:49:21,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:49:21,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:21,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642101546] [2025-03-13 21:49:21,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642101546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:21,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:21,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:49:21,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229777919] [2025-03-13 21:49:21,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:21,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:49:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:21,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:49:21,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:49:21,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-13 21:49:21,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:21,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:21,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-13 21:49:21,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:21,752 INFO L124 PetriNetUnfolderBase]: 121/237 cut-off events. [2025-03-13 21:49:21,753 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:49:21,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 237 events. 121/237 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 776 event pairs, 96 based on Foata normal form. 17/239 useless extension candidates. Maximal degree in co-relation 458. Up to 178 conditions per place. [2025-03-13 21:49:21,754 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 19 selfloop transitions, 2 changer transitions 8/33 dead transitions. [2025-03-13 21:49:21,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 130 flow [2025-03-13 21:49:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:49:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:49:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-03-13 21:49:21,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-13 21:49:21,761 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 52 flow. Second operand 4 states and 56 transitions. [2025-03-13 21:49:21,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 130 flow [2025-03-13 21:49:21,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:49:21,762 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 70 flow [2025-03-13 21:49:21,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2025-03-13 21:49:21,764 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-03-13 21:49:21,764 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 70 flow [2025-03-13 21:49:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:21,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:21,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:21,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:49:21,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:21,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1559089454, now seen corresponding path program 1 times [2025-03-13 21:49:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:21,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744548982] [2025-03-13 21:49:21,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:21,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:49:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:49:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744548982] [2025-03-13 21:49:22,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744548982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:22,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:22,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922664769] [2025-03-13 21:49:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:22,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:22,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:22,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:22,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:22,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 70 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:22,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:22,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:22,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:22,633 INFO L124 PetriNetUnfolderBase]: 205/380 cut-off events. [2025-03-13 21:49:22,634 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-13 21:49:22,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 380 events. 205/380 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1485 event pairs, 5 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 824. Up to 227 conditions per place. [2025-03-13 21:49:22,639 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 44 selfloop transitions, 14 changer transitions 5/66 dead transitions. [2025-03-13 21:49:22,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 66 transitions, 303 flow [2025-03-13 21:49:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-03-13 21:49:22,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2025-03-13 21:49:22,642 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 70 flow. Second operand 10 states and 113 transitions. [2025-03-13 21:49:22,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 66 transitions, 303 flow [2025-03-13 21:49:22,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 299 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:22,643 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 151 flow [2025-03-13 21:49:22,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-13 21:49:22,644 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 14 predicate places. [2025-03-13 21:49:22,644 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 151 flow [2025-03-13 21:49:22,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:22,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:22,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:22,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:49:22,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:22,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1018964508, now seen corresponding path program 2 times [2025-03-13 21:49:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:22,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275170663] [2025-03-13 21:49:22,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:22,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:22,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-13 21:49:22,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:22,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275170663] [2025-03-13 21:49:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275170663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:22,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:22,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469616055] [2025-03-13 21:49:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:22,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:22,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:22,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-13 21:49:22,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:22,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:22,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-13 21:49:22,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:22,748 INFO L124 PetriNetUnfolderBase]: 148/289 cut-off events. [2025-03-13 21:49:22,748 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-13 21:49:22,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 289 events. 148/289 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1049 event pairs, 31 based on Foata normal form. 8/296 useless extension candidates. Maximal degree in co-relation 803. Up to 221 conditions per place. [2025-03-13 21:49:22,750 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 35 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-03-13 21:49:22,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 242 flow [2025-03-13 21:49:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-13 21:49:22,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-13 21:49:22,751 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 151 flow. Second operand 3 states and 46 transitions. [2025-03-13 21:49:22,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 242 flow [2025-03-13 21:49:22,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 232 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:22,753 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 155 flow [2025-03-13 21:49:22,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-03-13 21:49:22,753 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-03-13 21:49:22,753 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 155 flow [2025-03-13 21:49:22,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:22,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:22,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:22,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:49:22,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2007233324, now seen corresponding path program 3 times [2025-03-13 21:49:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:22,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35090918] [2025-03-13 21:49:22,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:22,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:22,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:22,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-13 21:49:22,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:49:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35090918] [2025-03-13 21:49:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35090918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261225061] [2025-03-13 21:49:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:23,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:23,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:23,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:23,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:23,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 155 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:23,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:23,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:23,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:23,287 INFO L124 PetriNetUnfolderBase]: 190/369 cut-off events. [2025-03-13 21:49:23,287 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2025-03-13 21:49:23,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 369 events. 190/369 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1454 event pairs, 25 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1115. Up to 223 conditions per place. [2025-03-13 21:49:23,291 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 44 selfloop transitions, 18 changer transitions 5/70 dead transitions. [2025-03-13 21:49:23,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 431 flow [2025-03-13 21:49:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-13 21:49:23,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-13 21:49:23,293 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 155 flow. Second operand 10 states and 112 transitions. [2025-03-13 21:49:23,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 431 flow [2025-03-13 21:49:23,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 400 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:23,298 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 237 flow [2025-03-13 21:49:23,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-13 21:49:23,300 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 23 predicate places. [2025-03-13 21:49:23,300 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 237 flow [2025-03-13 21:49:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:23,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:23,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:49:23,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash -282080118, now seen corresponding path program 4 times [2025-03-13 21:49:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964724871] [2025-03-13 21:49:23,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:23,309 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:23,323 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:49:23,325 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:23,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964724871] [2025-03-13 21:49:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964724871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401776202] [2025-03-13 21:49:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:23,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:23,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:23,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:23,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:49:23,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 237 flow. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:23,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:23,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:49:23,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:23,854 INFO L124 PetriNetUnfolderBase]: 225/427 cut-off events. [2025-03-13 21:49:23,855 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-03-13 21:49:23,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 427 events. 225/427 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1702 event pairs, 34 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 1358. Up to 270 conditions per place. [2025-03-13 21:49:23,857 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 52 selfloop transitions, 22 changer transitions 5/81 dead transitions. [2025-03-13 21:49:23,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 550 flow [2025-03-13 21:49:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-03-13 21:49:23,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-13 21:49:23,858 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 237 flow. Second operand 10 states and 110 transitions. [2025-03-13 21:49:23,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 550 flow [2025-03-13 21:49:23,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 515 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:23,861 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 339 flow [2025-03-13 21:49:23,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-03-13 21:49:23,861 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 32 predicate places. [2025-03-13 21:49:23,862 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 339 flow [2025-03-13 21:49:23,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:23,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:23,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:49:23,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 500416654, now seen corresponding path program 5 times [2025-03-13 21:49:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217564490] [2025-03-13 21:49:23,862 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:23,869 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:23,879 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:49:23,879 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:23,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217564490] [2025-03-13 21:49:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217564490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:24,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340533308] [2025-03-13 21:49:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:24,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:24,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:24,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:24,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:24,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 339 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:24,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:24,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:24,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:24,424 INFO L124 PetriNetUnfolderBase]: 206/417 cut-off events. [2025-03-13 21:49:24,424 INFO L125 PetriNetUnfolderBase]: For 807/807 co-relation queries the response was YES. [2025-03-13 21:49:24,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 417 events. 206/417 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1784 event pairs, 15 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1474. Up to 223 conditions per place. [2025-03-13 21:49:24,426 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 50 selfloop transitions, 27 changer transitions 5/85 dead transitions. [2025-03-13 21:49:24,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 644 flow [2025-03-13 21:49:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2025-03-13 21:49:24,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2025-03-13 21:49:24,429 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 339 flow. Second operand 11 states and 122 transitions. [2025-03-13 21:49:24,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 644 flow [2025-03-13 21:49:24,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 630 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:24,433 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 429 flow [2025-03-13 21:49:24,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-03-13 21:49:24,435 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 44 predicate places. [2025-03-13 21:49:24,435 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 429 flow [2025-03-13 21:49:24,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:24,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:24,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:24,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:49:24,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:24,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash -655015518, now seen corresponding path program 6 times [2025-03-13 21:49:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826369057] [2025-03-13 21:49:24,437 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:24,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:24,451 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-13 21:49:24,452 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:49:24,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826369057] [2025-03-13 21:49:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826369057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:24,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:24,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635177742] [2025-03-13 21:49:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:24,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:24,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:24,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:24,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:24,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:24,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:24,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:24,899 INFO L124 PetriNetUnfolderBase]: 218/449 cut-off events. [2025-03-13 21:49:24,900 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2025-03-13 21:49:24,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 449 events. 218/449 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2011 event pairs, 22 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1726. Up to 287 conditions per place. [2025-03-13 21:49:24,904 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 55 selfloop transitions, 23 changer transitions 5/86 dead transitions. [2025-03-13 21:49:24,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 734 flow [2025-03-13 21:49:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-03-13 21:49:24,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-03-13 21:49:24,907 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 429 flow. Second operand 10 states and 114 transitions. [2025-03-13 21:49:24,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 734 flow [2025-03-13 21:49:24,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 656 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:24,913 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 452 flow [2025-03-13 21:49:24,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=452, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2025-03-13 21:49:24,914 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 48 predicate places. [2025-03-13 21:49:24,915 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 452 flow [2025-03-13 21:49:24,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:24,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:24,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:24,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:49:24,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:24,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 314086886, now seen corresponding path program 7 times [2025-03-13 21:49:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089649985] [2025-03-13 21:49:24,916 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:24,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:49:24,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:49:24,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089649985] [2025-03-13 21:49:25,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089649985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:25,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147165877] [2025-03-13 21:49:25,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:25,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:25,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:25,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:25,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:25,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 452 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:25,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:25,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:25,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:25,351 INFO L124 PetriNetUnfolderBase]: 214/436 cut-off events. [2025-03-13 21:49:25,352 INFO L125 PetriNetUnfolderBase]: For 1521/1521 co-relation queries the response was YES. [2025-03-13 21:49:25,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 436 events. 214/436 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1925 event pairs, 22 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 1732. Up to 291 conditions per place. [2025-03-13 21:49:25,356 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 49 selfloop transitions, 22 changer transitions 8/82 dead transitions. [2025-03-13 21:49:25,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 713 flow [2025-03-13 21:49:25,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2025-03-13 21:49:25,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3892857142857143 [2025-03-13 21:49:25,357 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 452 flow. Second operand 10 states and 109 transitions. [2025-03-13 21:49:25,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 713 flow [2025-03-13 21:49:25,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 656 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:25,364 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 448 flow [2025-03-13 21:49:25,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=448, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-03-13 21:49:25,366 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 51 predicate places. [2025-03-13 21:49:25,366 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 448 flow [2025-03-13 21:49:25,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:25,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:25,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:25,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:49:25,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:25,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:25,367 INFO L85 PathProgramCache]: Analyzing trace with hash 80856994, now seen corresponding path program 8 times [2025-03-13 21:49:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236685637] [2025-03-13 21:49:25,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:25,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:25,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-13 21:49:25,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:25,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236685637] [2025-03-13 21:49:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236685637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:25,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898189315] [2025-03-13 21:49:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:25,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:25,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:25,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:25,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:25,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:25,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:25,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:25,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:25,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:25,848 INFO L124 PetriNetUnfolderBase]: 223/461 cut-off events. [2025-03-13 21:49:25,848 INFO L125 PetriNetUnfolderBase]: For 1710/1718 co-relation queries the response was YES. [2025-03-13 21:49:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 461 events. 223/461 cut-off events. For 1710/1718 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2083 event pairs, 35 based on Foata normal form. 3/464 useless extension candidates. Maximal degree in co-relation 1827. Up to 297 conditions per place. [2025-03-13 21:49:25,851 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 58 selfloop transitions, 23 changer transitions 5/89 dead transitions. [2025-03-13 21:49:25,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 788 flow [2025-03-13 21:49:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2025-03-13 21:49:25,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2025-03-13 21:49:25,853 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 448 flow. Second operand 10 states and 116 transitions. [2025-03-13 21:49:25,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 788 flow [2025-03-13 21:49:25,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 734 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:25,857 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 491 flow [2025-03-13 21:49:25,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=491, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2025-03-13 21:49:25,858 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 53 predicate places. [2025-03-13 21:49:25,858 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 491 flow [2025-03-13 21:49:25,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:25,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:25,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:25,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:49:25,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:25,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash 847976418, now seen corresponding path program 9 times [2025-03-13 21:49:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:25,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754846771] [2025-03-13 21:49:25,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:25,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:25,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-13 21:49:25,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:49:25,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:26,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754846771] [2025-03-13 21:49:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754846771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:26,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:26,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520910054] [2025-03-13 21:49:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:26,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:26,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:26,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:26,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:26,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 491 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:26,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:26,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:26,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:26,251 INFO L124 PetriNetUnfolderBase]: 219/448 cut-off events. [2025-03-13 21:49:26,253 INFO L125 PetriNetUnfolderBase]: For 2218/2226 co-relation queries the response was YES. [2025-03-13 21:49:26,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 448 events. 219/448 cut-off events. For 2218/2226 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2008 event pairs, 35 based on Foata normal form. 3/451 useless extension candidates. Maximal degree in co-relation 1891. Up to 301 conditions per place. [2025-03-13 21:49:26,257 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 52 selfloop transitions, 22 changer transitions 8/85 dead transitions. [2025-03-13 21:49:26,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 793 flow [2025-03-13 21:49:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2025-03-13 21:49:26,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2025-03-13 21:49:26,258 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 491 flow. Second operand 10 states and 111 transitions. [2025-03-13 21:49:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 793 flow [2025-03-13 21:49:26,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 726 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:26,263 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 479 flow [2025-03-13 21:49:26,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=479, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2025-03-13 21:49:26,264 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 56 predicate places. [2025-03-13 21:49:26,264 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 479 flow [2025-03-13 21:49:26,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:26,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:26,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:26,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:49:26,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:26,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1418424208, now seen corresponding path program 10 times [2025-03-13 21:49:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:26,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578952871] [2025-03-13 21:49:26,266 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:26,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:26,281 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:49:26,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:26,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578952871] [2025-03-13 21:49:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578952871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278228020] [2025-03-13 21:49:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:26,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:26,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:26,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:26,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:49:26,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 479 flow. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:26,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:26,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:49:26,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:26,754 INFO L124 PetriNetUnfolderBase]: 260/516 cut-off events. [2025-03-13 21:49:26,755 INFO L125 PetriNetUnfolderBase]: For 2645/2645 co-relation queries the response was YES. [2025-03-13 21:49:26,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 516 events. 260/516 cut-off events. For 2645/2645 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2261 event pairs, 49 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 2159. Up to 339 conditions per place. [2025-03-13 21:49:26,758 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 67 selfloop transitions, 23 changer transitions 5/97 dead transitions. [2025-03-13 21:49:26,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 877 flow [2025-03-13 21:49:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-03-13 21:49:26,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-03-13 21:49:26,760 INFO L175 Difference]: Start difference. First operand has 84 places, 62 transitions, 479 flow. Second operand 10 states and 114 transitions. [2025-03-13 21:49:26,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 877 flow [2025-03-13 21:49:26,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 97 transitions, 821 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:26,765 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 546 flow [2025-03-13 21:49:26,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2025-03-13 21:49:26,766 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 59 predicate places. [2025-03-13 21:49:26,766 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 546 flow [2025-03-13 21:49:26,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:26,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:26,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:49:26,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:26,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2109423664, now seen corresponding path program 11 times [2025-03-13 21:49:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048123658] [2025-03-13 21:49:26,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:26,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:49:26,777 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:49:26,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:26,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048123658] [2025-03-13 21:49:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048123658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:49:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46338467] [2025-03-13 21:49:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:26,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:49:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:26,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:49:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:26,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:26,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 546 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:26,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:26,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:26,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:27,130 INFO L124 PetriNetUnfolderBase]: 229/465 cut-off events. [2025-03-13 21:49:27,131 INFO L125 PetriNetUnfolderBase]: For 3200/3208 co-relation queries the response was YES. [2025-03-13 21:49:27,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 465 events. 229/465 cut-off events. For 3200/3208 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2041 event pairs, 30 based on Foata normal form. 3/467 useless extension candidates. Maximal degree in co-relation 2086. Up to 316 conditions per place. [2025-03-13 21:49:27,133 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 56 selfloop transitions, 21 changer transitions 8/88 dead transitions. [2025-03-13 21:49:27,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 857 flow [2025-03-13 21:49:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-13 21:49:27,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-13 21:49:27,135 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 546 flow. Second operand 10 states and 112 transitions. [2025-03-13 21:49:27,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 857 flow [2025-03-13 21:49:27,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 780 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:27,141 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 524 flow [2025-03-13 21:49:27,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=524, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2025-03-13 21:49:27,141 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 63 predicate places. [2025-03-13 21:49:27,141 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 524 flow [2025-03-13 21:49:27,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:27,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:27,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:27,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:49:27,142 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:27,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1237710065, now seen corresponding path program 1 times [2025-03-13 21:49:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:27,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240429767] [2025-03-13 21:49:27,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:27,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:27,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:27,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:27,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240429767] [2025-03-13 21:49:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240429767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:49:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222853068] [2025-03-13 21:49:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:27,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:49:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:27,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:49:27,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:49:27,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-13 21:49:27,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 66 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:27,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:27,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-13 21:49:27,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:27,271 INFO L124 PetriNetUnfolderBase]: 281/615 cut-off events. [2025-03-13 21:49:27,271 INFO L125 PetriNetUnfolderBase]: For 5498/5616 co-relation queries the response was YES. [2025-03-13 21:49:27,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 615 events. 281/615 cut-off events. For 5498/5616 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3049 event pairs, 68 based on Foata normal form. 40/654 useless extension candidates. Maximal degree in co-relation 2675. Up to 205 conditions per place. [2025-03-13 21:49:27,275 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 54 selfloop transitions, 7 changer transitions 24/89 dead transitions. [2025-03-13 21:49:27,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 845 flow [2025-03-13 21:49:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:49:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:49:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-03-13 21:49:27,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2025-03-13 21:49:27,276 INFO L175 Difference]: Start difference. First operand has 91 places, 66 transitions, 524 flow. Second operand 4 states and 74 transitions. [2025-03-13 21:49:27,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 845 flow [2025-03-13 21:49:27,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 772 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-03-13 21:49:27,284 INFO L231 Difference]: Finished difference. Result has 82 places, 39 transitions, 290 flow [2025-03-13 21:49:27,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=82, PETRI_TRANSITIONS=39} [2025-03-13 21:49:27,286 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 54 predicate places. [2025-03-13 21:49:27,286 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 39 transitions, 290 flow [2025-03-13 21:49:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:27,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:27,286 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] [2025-03-13 21:49:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:49:27,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1277056949, now seen corresponding path program 1 times [2025-03-13 21:49:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160076697] [2025-03-13 21:49:27,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:27,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:27,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:27,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:27,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:27,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160076697] [2025-03-13 21:49:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160076697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721238457] [2025-03-13 21:49:27,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:27,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:27,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:27,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:49:27,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:27,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:27,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:27,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:27,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:49:27,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:27,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:27,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721238457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:27,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-13 21:49:27,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213541504] [2025-03-13 21:49:27,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:27,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:49:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:27,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:49:27,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:49:27,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-13 21:49:27,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 39 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:27,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:27,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-13 21:49:27,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:27,689 INFO L124 PetriNetUnfolderBase]: 281/590 cut-off events. [2025-03-13 21:49:27,689 INFO L125 PetriNetUnfolderBase]: For 4692/4747 co-relation queries the response was YES. [2025-03-13 21:49:27,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2664 conditions, 590 events. 281/590 cut-off events. For 4692/4747 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2632 event pairs, 173 based on Foata normal form. 24/613 useless extension candidates. Maximal degree in co-relation 2633. Up to 392 conditions per place. [2025-03-13 21:49:27,695 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 3 changer transitions 25/65 dead transitions. [2025-03-13 21:49:27,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 593 flow [2025-03-13 21:49:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2025-03-13 21:49:27,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-13 21:49:27,696 INFO L175 Difference]: Start difference. First operand has 82 places, 39 transitions, 290 flow. Second operand 6 states and 77 transitions. [2025-03-13 21:49:27,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 593 flow [2025-03-13 21:49:27,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 468 flow, removed 51 selfloop flow, removed 18 redundant places. [2025-03-13 21:49:27,703 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 232 flow [2025-03-13 21:49:27,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-03-13 21:49:27,703 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 25 predicate places. [2025-03-13 21:49:27,704 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 232 flow [2025-03-13 21:49:27,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:27,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:27,704 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:27,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:49:27,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:49:27,905 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:27,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2064889113, now seen corresponding path program 2 times [2025-03-13 21:49:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541568663] [2025-03-13 21:49:27,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:27,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:49:27,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-03-13 21:49:27,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:27,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:27,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541568663] [2025-03-13 21:49:27,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541568663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:27,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:27,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:49:27,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977537689] [2025-03-13 21:49:27,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:27,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:49:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:27,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:49:27,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:49:27,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:49:27,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:27,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:27,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:49:27,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:28,123 INFO L124 PetriNetUnfolderBase]: 354/687 cut-off events. [2025-03-13 21:49:28,123 INFO L125 PetriNetUnfolderBase]: For 1080/1080 co-relation queries the response was YES. [2025-03-13 21:49:28,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 687 events. 354/687 cut-off events. For 1080/1080 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2873 event pairs, 50 based on Foata normal form. 28/714 useless extension candidates. Maximal degree in co-relation 2202. Up to 342 conditions per place. [2025-03-13 21:49:28,128 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 62 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-13 21:49:28,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 548 flow [2025-03-13 21:49:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:49:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:49:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2025-03-13 21:49:28,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2025-03-13 21:49:28,129 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 232 flow. Second operand 5 states and 69 transitions. [2025-03-13 21:49:28,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 548 flow [2025-03-13 21:49:28,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 518 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:28,131 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 272 flow [2025-03-13 21:49:28,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-03-13 21:49:28,132 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 24 predicate places. [2025-03-13 21:49:28,132 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 272 flow [2025-03-13 21:49:28,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:28,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:28,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:49:28,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:28,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash -561088610, now seen corresponding path program 1 times [2025-03-13 21:49:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861299353] [2025-03-13 21:49:28,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:28,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:49:28,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:28,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:28,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861299353] [2025-03-13 21:49:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861299353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496644096] [2025-03-13 21:49:28,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:28,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:28,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:28,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:49:29,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:49:29,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:29,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:29,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-13 21:49:29,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:29,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:30,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:30,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2025-03-13 21:49:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496644096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:30,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13] total 43 [2025-03-13 21:49:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188849440] [2025-03-13 21:49:30,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:30,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-13 21:49:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:30,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-13 21:49:30,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1751, Unknown=0, NotChecked=0, Total=1892 [2025-03-13 21:49:30,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:49:30,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 272 flow. Second operand has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:30,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:30,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:49:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:32,257 INFO L124 PetriNetUnfolderBase]: 863/1525 cut-off events. [2025-03-13 21:49:32,259 INFO L125 PetriNetUnfolderBase]: For 3011/3011 co-relation queries the response was YES. [2025-03-13 21:49:32,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 1525 events. 863/1525 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7210 event pairs, 109 based on Foata normal form. 1/1526 useless extension candidates. Maximal degree in co-relation 5225. Up to 882 conditions per place. [2025-03-13 21:49:32,266 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 111 selfloop transitions, 81 changer transitions 5/198 dead transitions. [2025-03-13 21:49:32,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 198 transitions, 1514 flow [2025-03-13 21:49:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 21:49:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 21:49:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 257 transitions. [2025-03-13 21:49:32,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2699579831932773 [2025-03-13 21:49:32,269 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 272 flow. Second operand 34 states and 257 transitions. [2025-03-13 21:49:32,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 198 transitions, 1514 flow [2025-03-13 21:49:32,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 198 transitions, 1491 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:32,277 INFO L231 Difference]: Finished difference. Result has 92 places, 118 transitions, 1128 flow [2025-03-13 21:49:32,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1128, PETRI_PLACES=92, PETRI_TRANSITIONS=118} [2025-03-13 21:49:32,277 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 64 predicate places. [2025-03-13 21:49:32,278 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 118 transitions, 1128 flow [2025-03-13 21:49:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:32,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:32,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:32,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:49:32,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 21:49:32,478 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:32,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1848454432, now seen corresponding path program 2 times [2025-03-13 21:49:32,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:32,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500771239] [2025-03-13 21:49:32,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:32,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:32,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:32,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:32,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:33,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500771239] [2025-03-13 21:49:33,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500771239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98250321] [2025-03-13 21:49:33,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:33,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:33,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:33,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:33,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:49:33,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:33,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:33,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-13 21:49:33,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:33,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-03-13 21:49:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:34,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:34,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:34,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2025-03-13 21:49:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98250321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:35,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:35,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-03-13 21:49:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941209944] [2025-03-13 21:49:35,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:35,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-13 21:49:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:35,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-13 21:49:35,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2594, Unknown=0, NotChecked=0, Total=2862 [2025-03-13 21:49:35,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:49:35,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 118 transitions, 1128 flow. Second operand has 54 states, 54 states have (on average 4.444444444444445) internal successors, (240), 54 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:35,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:35,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:49:35,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:46,809 INFO L124 PetriNetUnfolderBase]: 2078/3701 cut-off events. [2025-03-13 21:49:46,809 INFO L125 PetriNetUnfolderBase]: For 9436/9436 co-relation queries the response was YES. [2025-03-13 21:49:46,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15263 conditions, 3701 events. 2078/3701 cut-off events. For 9436/9436 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 21748 event pairs, 56 based on Foata normal form. 3/3704 useless extension candidates. Maximal degree in co-relation 15238. Up to 1151 conditions per place. [2025-03-13 21:49:46,827 INFO L140 encePairwiseOnDemand]: 11/28 looper letters, 296 selfloop transitions, 332 changer transitions 43/672 dead transitions. [2025-03-13 21:49:46,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 672 transitions, 5957 flow [2025-03-13 21:49:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-13 21:49:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-03-13 21:49:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 759 transitions. [2025-03-13 21:49:46,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2978806907378336 [2025-03-13 21:49:46,830 INFO L175 Difference]: Start difference. First operand has 92 places, 118 transitions, 1128 flow. Second operand 91 states and 759 transitions. [2025-03-13 21:49:46,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 672 transitions, 5957 flow [2025-03-13 21:49:46,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 672 transitions, 5562 flow, removed 191 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:46,856 INFO L231 Difference]: Finished difference. Result has 209 places, 417 transitions, 4534 flow [2025-03-13 21:49:46,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=4534, PETRI_PLACES=209, PETRI_TRANSITIONS=417} [2025-03-13 21:49:46,857 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 181 predicate places. [2025-03-13 21:49:46,857 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 417 transitions, 4534 flow [2025-03-13 21:49:46,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.444444444444445) internal successors, (240), 54 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:46,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:46,857 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:46,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:49:47,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 21:49:47,058 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1413746000, now seen corresponding path program 3 times [2025-03-13 21:49:47,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:47,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621831483] [2025-03-13 21:49:47,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:47,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:47,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:47,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:47,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:47,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:47,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:47,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621831483] [2025-03-13 21:49:47,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621831483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:47,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107431588] [2025-03-13 21:49:47,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:47,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:47,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:47,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:49:47,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:47,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:47,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:47,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:47,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-13 21:49:47,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:48,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-13 21:49:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:48,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:49,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:49,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-13 21:49:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:49,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107431588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:49,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:49,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2025-03-13 21:49:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584313273] [2025-03-13 21:49:49,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-13 21:49:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:49,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-13 21:49:49,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2412, Unknown=0, NotChecked=0, Total=2652 [2025-03-13 21:49:49,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:49:49,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 417 transitions, 4534 flow. Second operand has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:49,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:49,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:49:49,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:07,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-13 21:50:13,632 INFO L124 PetriNetUnfolderBase]: 4336/7936 cut-off events. [2025-03-13 21:50:13,633 INFO L125 PetriNetUnfolderBase]: For 62656/62656 co-relation queries the response was YES. [2025-03-13 21:50:13,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42630 conditions, 7936 events. 4336/7936 cut-off events. For 62656/62656 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 55201 event pairs, 170 based on Foata normal form. 6/7942 useless extension candidates. Maximal degree in co-relation 42574. Up to 2311 conditions per place. [2025-03-13 21:50:13,692 INFO L140 encePairwiseOnDemand]: 11/28 looper letters, 602 selfloop transitions, 859 changer transitions 45/1507 dead transitions. [2025-03-13 21:50:13,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1507 transitions, 17869 flow [2025-03-13 21:50:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2025-03-13 21:50:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2025-03-13 21:50:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 1144 transitions. [2025-03-13 21:50:13,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30264550264550266 [2025-03-13 21:50:13,695 INFO L175 Difference]: Start difference. First operand has 209 places, 417 transitions, 4534 flow. Second operand 135 states and 1144 transitions. [2025-03-13 21:50:13,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1507 transitions, 17869 flow [2025-03-13 21:50:13,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 1507 transitions, 16469 flow, removed 693 selfloop flow, removed 7 redundant places. [2025-03-13 21:50:13,969 INFO L231 Difference]: Finished difference. Result has 385 places, 1085 transitions, 14362 flow [2025-03-13 21:50:13,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3954, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=300, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=135, PETRI_FLOW=14362, PETRI_PLACES=385, PETRI_TRANSITIONS=1085} [2025-03-13 21:50:13,969 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 357 predicate places. [2025-03-13 21:50:13,969 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 1085 transitions, 14362 flow [2025-03-13 21:50:13,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:13,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:13,970 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:13,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:14,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:14,170 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:14,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1830410998, now seen corresponding path program 4 times [2025-03-13 21:50:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078758048] [2025-03-13 21:50:14,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:14,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:14,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:14,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:14,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078758048] [2025-03-13 21:50:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078758048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897701142] [2025-03-13 21:50:14,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:14,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:14,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:50:15,013 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:15,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:15,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:15,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:15,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-13 21:50:15,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:15,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:16,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:16,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-13 21:50:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897701142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:16,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2025-03-13 21:50:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80486148] [2025-03-13 21:50:16,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:16,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-13 21:50:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:16,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-13 21:50:16,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2445, Unknown=0, NotChecked=0, Total=2652 [2025-03-13 21:50:16,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:50:16,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 1085 transitions, 14362 flow. Second operand has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:16,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:16,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:50:16,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:25,080 INFO L124 PetriNetUnfolderBase]: 4554/8350 cut-off events. [2025-03-13 21:50:25,080 INFO L125 PetriNetUnfolderBase]: For 161856/161856 co-relation queries the response was YES. [2025-03-13 21:50:25,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55783 conditions, 8350 events. 4554/8350 cut-off events. For 161856/161856 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 58793 event pairs, 382 based on Foata normal form. 2/8352 useless extension candidates. Maximal degree in co-relation 55669. Up to 5116 conditions per place. [2025-03-13 21:50:25,165 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 707 selfloop transitions, 688 changer transitions 10/1406 dead transitions. [2025-03-13 21:50:25,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1406 transitions, 20883 flow [2025-03-13 21:50:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-13 21:50:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-03-13 21:50:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 531 transitions. [2025-03-13 21:50:25,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2917582417582418 [2025-03-13 21:50:25,167 INFO L175 Difference]: Start difference. First operand has 385 places, 1085 transitions, 14362 flow. Second operand 65 states and 531 transitions. [2025-03-13 21:50:25,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 1406 transitions, 20883 flow [2025-03-13 21:50:26,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 1406 transitions, 18433 flow, removed 1123 selfloop flow, removed 31 redundant places. [2025-03-13 21:50:26,768 INFO L231 Difference]: Finished difference. Result has 428 places, 1220 transitions, 16950 flow [2025-03-13 21:50:26,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12383, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=568, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=16950, PETRI_PLACES=428, PETRI_TRANSITIONS=1220} [2025-03-13 21:50:26,769 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 400 predicate places. [2025-03-13 21:50:26,769 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 1220 transitions, 16950 flow [2025-03-13 21:50:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:26,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:26,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:26,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:50:26,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:26,970 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:26,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1153271538, now seen corresponding path program 5 times [2025-03-13 21:50:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:26,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703859014] [2025-03-13 21:50:26,971 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:26,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:26,987 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:26,987 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:26,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703859014] [2025-03-13 21:50:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703859014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644423031] [2025-03-13 21:50:27,743 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:27,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:27,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:27,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:27,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:50:27,786 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:27,816 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:27,817 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:27,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:27,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-13 21:50:27,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:28,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:28,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:28,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 27 [2025-03-13 21:50:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644423031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:29,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13] total 43 [2025-03-13 21:50:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713293251] [2025-03-13 21:50:29,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:29,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-13 21:50:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-13 21:50:29,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1719, Unknown=0, NotChecked=0, Total=1892 [2025-03-13 21:50:29,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:50:29,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 1220 transitions, 16950 flow. Second operand has 44 states, 44 states have (on average 4.7272727272727275) internal successors, (208), 44 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:29,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:29,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:50:29,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:32,318 INFO L124 PetriNetUnfolderBase]: 4729/8713 cut-off events. [2025-03-13 21:50:32,319 INFO L125 PetriNetUnfolderBase]: For 156783/156783 co-relation queries the response was YES. [2025-03-13 21:50:32,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58952 conditions, 8713 events. 4729/8713 cut-off events. For 156783/156783 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 62037 event pairs, 352 based on Foata normal form. 4/8717 useless extension candidates. Maximal degree in co-relation 58827. Up to 3342 conditions per place. [2025-03-13 21:50:32,432 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 706 selfloop transitions, 698 changer transitions 22/1427 dead transitions. [2025-03-13 21:50:32,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 1427 transitions, 22210 flow [2025-03-13 21:50:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-13 21:50:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-13 21:50:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 205 transitions. [2025-03-13 21:50:32,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30505952380952384 [2025-03-13 21:50:32,433 INFO L175 Difference]: Start difference. First operand has 428 places, 1220 transitions, 16950 flow. Second operand 24 states and 205 transitions. [2025-03-13 21:50:32,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 1427 transitions, 22210 flow [2025-03-13 21:50:34,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 1427 transitions, 21388 flow, removed 342 selfloop flow, removed 21 redundant places. [2025-03-13 21:50:34,256 INFO L231 Difference]: Finished difference. Result has 437 places, 1284 transitions, 19531 flow [2025-03-13 21:50:34,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16156, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=637, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=19531, PETRI_PLACES=437, PETRI_TRANSITIONS=1284} [2025-03-13 21:50:34,257 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 409 predicate places. [2025-03-13 21:50:34,257 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 1284 transitions, 19531 flow [2025-03-13 21:50:34,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.7272727272727275) internal successors, (208), 44 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:34,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:34,257 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:34,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:50:34,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:34,458 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:34,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1947878206, now seen corresponding path program 6 times [2025-03-13 21:50:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:34,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049980415] [2025-03-13 21:50:34,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:34,462 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:34,471 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:34,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:50:34,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:35,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049980415] [2025-03-13 21:50:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049980415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330938837] [2025-03-13 21:50:35,246 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:35,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:35,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:35,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:50:35,307 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:35,356 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:35,357 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:50:35,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:35,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-13 21:50:35,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:36,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:36,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:36,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-13 21:50:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330938837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:37,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 50 [2025-03-13 21:50:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834375581] [2025-03-13 21:50:37,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:37,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-13 21:50:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:37,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-13 21:50:37,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2274, Unknown=0, NotChecked=0, Total=2550 [2025-03-13 21:50:37,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:50:37,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1284 transitions, 19531 flow. Second operand has 51 states, 51 states have (on average 4.509803921568627) internal successors, (230), 51 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:37,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:37,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:50:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:44,691 INFO L124 PetriNetUnfolderBase]: 4876/8989 cut-off events. [2025-03-13 21:50:44,691 INFO L125 PetriNetUnfolderBase]: For 170359/170359 co-relation queries the response was YES. [2025-03-13 21:50:44,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65363 conditions, 8989 events. 4876/8989 cut-off events. For 170359/170359 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 64951 event pairs, 422 based on Foata normal form. 3/8992 useless extension candidates. Maximal degree in co-relation 65231. Up to 5221 conditions per place. [2025-03-13 21:50:44,795 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 738 selfloop transitions, 836 changer transitions 30/1605 dead transitions. [2025-03-13 21:50:44,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 1605 transitions, 26124 flow [2025-03-13 21:50:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-13 21:50:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2025-03-13 21:50:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 599 transitions. [2025-03-13 21:50:44,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27782931354359924 [2025-03-13 21:50:44,797 INFO L175 Difference]: Start difference. First operand has 437 places, 1284 transitions, 19531 flow. Second operand 77 states and 599 transitions. [2025-03-13 21:50:44,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 1605 transitions, 26124 flow [2025-03-13 21:50:46,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 1605 transitions, 25913 flow, removed 80 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:46,630 INFO L231 Difference]: Finished difference. Result has 520 places, 1386 transitions, 23631 flow [2025-03-13 21:50:46,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=19374, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=735, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=23631, PETRI_PLACES=520, PETRI_TRANSITIONS=1386} [2025-03-13 21:50:46,631 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 492 predicate places. [2025-03-13 21:50:46,631 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 1386 transitions, 23631 flow [2025-03-13 21:50:46,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.509803921568627) internal successors, (230), 51 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:46,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:46,631 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:46,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:46,832 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1494124588, now seen corresponding path program 7 times [2025-03-13 21:50:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898602890] [2025-03-13 21:50:46,833 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:46,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:50:46,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:46,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:46,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:47,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:47,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898602890] [2025-03-13 21:50:47,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898602890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:47,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689843255] [2025-03-13 21:50:47,675 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:47,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:47,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:47,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:47,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:50:47,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:50:47,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:47,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:47,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:47,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-13 21:50:47,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:48,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:48,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:48,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-03-13 21:50:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689843255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:49,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:49,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 12] total 42 [2025-03-13 21:50:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60109053] [2025-03-13 21:50:49,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:49,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-13 21:50:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:49,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-13 21:50:49,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1668, Unknown=0, NotChecked=0, Total=1806 [2025-03-13 21:50:49,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:50:49,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 1386 transitions, 23631 flow. Second operand has 43 states, 43 states have (on average 4.790697674418604) internal successors, (206), 43 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:49,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:49,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:50:49,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand