./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:40:57,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:40:57,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:40:57,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:40:57,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:40:57,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:40:57,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:40:57,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:40:57,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:40:57,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:40:57,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:40:57,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:40:57,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:40:57,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:40:57,707 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:40:57,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:40:57,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:40:57,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:40:57,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:40:57,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:40:57,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:57,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:57,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:57,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:57,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:40:57,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:57,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:57,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:57,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:57,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:40:57,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:40:57,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:40:57,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:40:57,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:40:57,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:40:57,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:40:57,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:40:57,713 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-jdk21/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2025-01-10 00:40:58,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:40:58,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:40:58,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:40:58,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:40:58,036 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:40:58,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-01-10 00:40:59,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f943448e9/222319a6743d4785bc74efb64590b4dd/FLAGb8c46131e [2025-01-10 00:40:59,780 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:40:59,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-01-10 00:40:59,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f943448e9/222319a6743d4785bc74efb64590b4dd/FLAGb8c46131e [2025-01-10 00:40:59,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f943448e9/222319a6743d4785bc74efb64590b4dd [2025-01-10 00:40:59,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:40:59,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:40:59,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:59,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:40:59,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:40:59,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:59" (1/1) ... [2025-01-10 00:40:59,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ce60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:59, skipping insertion in model container [2025-01-10 00:40:59,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:59" (1/1) ... [2025-01-10 00:40:59,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:41:00,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:00,317 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:41:00,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:00,396 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:41:00,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00 WrapperNode [2025-01-10 00:41:00,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:41:00,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:00,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:41:00,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:41:00,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,435 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-01-10 00:41:00,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:00,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:41:00,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:41:00,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:41:00,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,461 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:41:00,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:41:00,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:41:00,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:41:00,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:41:00,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (1/1) ... [2025-01-10 00:41:00,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:00,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:00,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:41:00,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:41:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:41:00,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:41:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:41:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:41:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:41:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:41:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:41:00,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:41:00,548 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:41:00,656 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:41:00,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:41:00,730 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:41:00,730 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:41:00,814 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:41:00,814 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 00:41:00,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:00 BoogieIcfgContainer [2025-01-10 00:41:00,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:41:00,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:41:00,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:41:00,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:41:00,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:40:59" (1/3) ... [2025-01-10 00:41:00,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be34e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:00, skipping insertion in model container [2025-01-10 00:41:00,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:00" (2/3) ... [2025-01-10 00:41:00,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be34e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:00, skipping insertion in model container [2025-01-10 00:41:00,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:00" (3/3) ... [2025-01-10 00:41:00,824 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-01-10 00:41:00,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:41:00,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 12 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-10 00:41:00,839 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:41:00,877 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:00,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 12 transitions, 28 flow [2025-01-10 00:41:00,935 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-01-10 00:41:00,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:00,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-10 00:41:00,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 12 transitions, 28 flow [2025-01-10 00:41:00,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 12 transitions, 28 flow [2025-01-10 00:41:00,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:00,970 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=None, 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;@2c2d17aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:00,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 00:41:00,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:00,976 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:41:00,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:00,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:00,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:41:00,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:41:00,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash 133997, now seen corresponding path program 1 times [2025-01-10 00:41:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:00,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188271250] [2025-01-10 00:41:00,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:41:01,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:41:01,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188271250] [2025-01-10 00:41:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188271250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:01,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490319933] [2025-01-10 00:41:01,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:01,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:41:01,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:01,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:41:01,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:41:01,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 12 [2025-01-10 00:41:01,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 28 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-01-10 00:41:01,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:01,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 12 [2025-01-10 00:41:01,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:01,191 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-01-10 00:41:01,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:01,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 28. Up to 17 conditions per place. [2025-01-10 00:41:01,197 INFO L140 encePairwiseOnDemand]: 11/12 looper letters, 7 selfloop transitions, 0 changer transitions 0/9 dead transitions. [2025-01-10 00:41:01,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 9 transitions, 36 flow [2025-01-10 00:41:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:41:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:41:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2025-01-10 00:41:01,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 00:41:01,213 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 2 states and 14 transitions. [2025-01-10 00:41:01,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 9 transitions, 36 flow [2025-01-10 00:41:01,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 9 transitions, 36 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:01,220 INFO L231 Difference]: Finished difference. Result has 13 places, 9 transitions, 22 flow [2025-01-10 00:41:01,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=22, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=22, PETRI_PLACES=13, PETRI_TRANSITIONS=9} [2025-01-10 00:41:01,227 INFO L279 CegarLoopForPetriNet]: 15 programPoint places, -2 predicate places. [2025-01-10 00:41:01,228 INFO L471 AbstractCegarLoop]: Abstraction has has 13 places, 9 transitions, 22 flow [2025-01-10 00:41:01,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-01-10 00:41:01,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:01,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 00:41:01,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:41:01,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:41:01,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash 128811935, now seen corresponding path program 1 times [2025-01-10 00:41:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:01,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176079745] [2025-01-10 00:41:01,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:41:01,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:41:01,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:01,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:41:01,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:41:01,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:41:01,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:01,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:41:01,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:41:01,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-10 00:41:01,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 00:41:01,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-01-10 00:41:01,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-01-10 00:41:01,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:41:01,299 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:41:01,301 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:41:01,302 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:41:01,316 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:01,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2025-01-10 00:41:01,325 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-01-10 00:41:01,327 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:41:01,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 26 events. 0/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 73 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-01-10 00:41:01,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2025-01-10 00:41:01,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2025-01-10 00:41:01,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:01,331 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=None, 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;@2c2d17aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:01,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 00:41:01,337 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:01,337 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:41:01,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:01,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:01,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:41:01,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:41:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 151871, now seen corresponding path program 1 times [2025-01-10 00:41:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111950466] [2025-01-10 00:41:01,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:01,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:41:01,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:41:01,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:01,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111950466] [2025-01-10 00:41:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111950466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:01,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:01,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:01,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532866870] [2025-01-10 00:41:01,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:01,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:41:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:01,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:41:01,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:41:01,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-01-10 00:41:01,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-01-10 00:41:01,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:01,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-01-10 00:41:01,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:01,440 INFO L124 PetriNetUnfolderBase]: 64/140 cut-off events. [2025-01-10 00:41:01,441 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 00:41:01,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 140 events. 64/140 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 540 event pairs, 64 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 74. Up to 127 conditions per place. [2025-01-10 00:41:01,445 INFO L140 encePairwiseOnDemand]: 17/18 looper letters, 12 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2025-01-10 00:41:01,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 64 flow [2025-01-10 00:41:01,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:41:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:41:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2025-01-10 00:41:01,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 00:41:01,449 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 2 states and 21 transitions. [2025-01-10 00:41:01,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 64 flow [2025-01-10 00:41:01,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 15 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:01,450 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 40 flow [2025-01-10 00:41:01,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2025-01-10 00:41:01,452 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -2 predicate places. [2025-01-10 00:41:01,452 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 40 flow [2025-01-10 00:41:01,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-01-10 00:41:01,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:01,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:41:01,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:41:01,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:41:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash 230864571, now seen corresponding path program 1 times [2025-01-10 00:41:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-01-10 00:41:01,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:41:01,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:41:01,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:01,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-01-10 00:41:01,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558157259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:01,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:01,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374514556] [2025-01-10 00:41:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:01,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:01,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:01,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:01,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:01,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2025-01-10 00:41:01,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 15 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:01,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:01,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2025-01-10 00:41:01,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:01,640 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2025-01-10 00:41:01,640 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 00:41:01,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 797 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 445. Up to 116 conditions per place. [2025-01-10 00:41:01,643 INFO L140 encePairwiseOnDemand]: 14/18 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-01-10 00:41:01,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 109 flow [2025-01-10 00:41:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-01-10 00:41:01,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-10 00:41:01,644 INFO L175 Difference]: Start difference. First operand has 21 places, 15 transitions, 40 flow. Second operand 3 states and 30 transitions. [2025-01-10 00:41:01,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 109 flow [2025-01-10 00:41:01,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:01,647 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 62 flow [2025-01-10 00:41:01,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2025-01-10 00:41:01,647 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-01-10 00:41:01,648 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2025-01-10 00:41:01,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:01,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:01,648 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-01-10 00:41:01,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:41:01,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:41:01,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1433455091, now seen corresponding path program 1 times [2025-01-10 00:41:01,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:01,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819715211] [2025-01-10 00:41:01,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:41:01,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:41:01,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:01,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:41:01,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:41:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:41:01,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:01,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:41:01,693 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:41:01,693 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-10 00:41:01,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 00:41:01,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-01-10 00:41:01,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-01-10 00:41:01,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 00:41:01,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:41:01,694 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:41:01,695 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:41:01,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:41:01,714 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:01,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 66 flow [2025-01-10 00:41:01,747 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-01-10 00:41:01,748 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:41:01,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 0/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-01-10 00:41:01,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 24 transitions, 66 flow [2025-01-10 00:41:01,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 66 flow [2025-01-10 00:41:01,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:01,750 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=None, 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;@2c2d17aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:01,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:41:01,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:01,752 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:41:01,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:01,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:01,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:41:01,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:41:01,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 175703, now seen corresponding path program 1 times [2025-01-10 00:41:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718789226] [2025-01-10 00:41:01,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:41:01,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:41:01,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718789226] [2025-01-10 00:41:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718789226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:01,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576702679] [2025-01-10 00:41:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:41:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:01,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:41:01,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:41:01,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-10 00:41:01,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-10 00:41:01,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:01,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-10 00:41:01,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:01,929 INFO L124 PetriNetUnfolderBase]: 564/942 cut-off events. [2025-01-10 00:41:01,929 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-01-10 00:41:01,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 942 events. 564/942 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4920 event pairs, 564 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 287. Up to 877 conditions per place. [2025-01-10 00:41:01,942 INFO L140 encePairwiseOnDemand]: 23/24 looper letters, 17 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-01-10 00:41:01,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 94 flow [2025-01-10 00:41:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:41:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:41:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2025-01-10 00:41:01,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 00:41:01,944 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 2 states and 28 transitions. [2025-01-10 00:41:01,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 94 flow [2025-01-10 00:41:01,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:01,946 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-01-10 00:41:01,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-01-10 00:41:01,947 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2025-01-10 00:41:01,947 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-01-10 00:41:01,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-10 00:41:01,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:01,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:41:01,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:41:01,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:41:01,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 941016470, now seen corresponding path program 1 times [2025-01-10 00:41:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777534710] [2025-01-10 00:41:01,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:41:01,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:41:01,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:01,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777534710] [2025-01-10 00:41:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777534710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943180500] [2025-01-10 00:41:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:01,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:01,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:01,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:02,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-01-10 00:41:02,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:02,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:02,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-01-10 00:41:02,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:02,267 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2025-01-10 00:41:02,268 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-01-10 00:41:02,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 2070 events. 1343/2070 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10011 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 4288. Up to 1272 conditions per place. [2025-01-10 00:41:02,283 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-01-10 00:41:02,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 168 flow [2025-01-10 00:41:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-01-10 00:41:02,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 00:41:02,287 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 58 flow. Second operand 3 states and 42 transitions. [2025-01-10 00:41:02,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 168 flow [2025-01-10 00:41:02,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:02,290 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 88 flow [2025-01-10 00:41:02,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-01-10 00:41:02,291 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-01-10 00:41:02,291 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 88 flow [2025-01-10 00:41:02,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:02,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:02,292 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:02,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:41:02,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:41:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1931094716, now seen corresponding path program 1 times [2025-01-10 00:41:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776502876] [2025-01-10 00:41:02,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:02,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:41:02,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:41:02,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:02,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776502876] [2025-01-10 00:41:02,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776502876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:02,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:02,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:02,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846906627] [2025-01-10 00:41:02,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:02,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:02,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:02,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:02,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:02,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-01-10 00:41:02,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-10 00:41:02,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:02,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-01-10 00:41:02,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:02,616 INFO L124 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2025-01-10 00:41:02,616 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2025-01-10 00:41:02,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6319 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13530 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 6311. Up to 1546 conditions per place. [2025-01-10 00:41:02,638 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2025-01-10 00:41:02,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 221 flow [2025-01-10 00:41:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-01-10 00:41:02,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-01-10 00:41:02,642 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 88 flow. Second operand 3 states and 41 transitions. [2025-01-10 00:41:02,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 221 flow [2025-01-10 00:41:02,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:02,647 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2025-01-10 00:41:02,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-01-10 00:41:02,648 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2025-01-10 00:41:02,648 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2025-01-10 00:41:02,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-10 00:41:02,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:02,648 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-01-10 00:41:02,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:41:02,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:41:02,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash 265135628, now seen corresponding path program 1 times [2025-01-10 00:41:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:02,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620540035] [2025-01-10 00:41:02,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:02,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:41:02,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:41:02,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:02,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:02,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:41:02,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:41:02,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:41:02,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:02,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:02,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:41:02,670 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:41:02,670 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 00:41:02,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:41:02,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:41:02,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-01-10 00:41:02,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-01-10 00:41:02,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:41:02,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:41:02,675 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:41:02,676 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:41:02,676 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 00:41:02,701 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:02,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 88 flow [2025-01-10 00:41:02,706 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-01-10 00:41:02,706 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:41:02,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 46 events. 0/46 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 145 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-01-10 00:41:02,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 30 transitions, 88 flow [2025-01-10 00:41:02,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 88 flow [2025-01-10 00:41:02,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:02,708 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=None, 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;@2c2d17aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:02,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:41:02,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:02,709 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:41:02,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:02,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:02,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:41:02,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:02,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:02,709 INFO L85 PathProgramCache]: Analyzing trace with hash 205493, now seen corresponding path program 1 times [2025-01-10 00:41:02,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:02,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888455156] [2025-01-10 00:41:02,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:02,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:41:02,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:41:02,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:02,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888455156] [2025-01-10 00:41:02,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888455156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:02,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:02,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882650216] [2025-01-10 00:41:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:02,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:41:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:02,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:41:02,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:41:02,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-01-10 00:41:02,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-01-10 00:41:02,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:02,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-01-10 00:41:02,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:03,186 INFO L124 PetriNetUnfolderBase]: 4064/5956 cut-off events. [2025-01-10 00:41:03,186 INFO L125 PetriNetUnfolderBase]: For 1817/1817 co-relation queries the response was YES. [2025-01-10 00:41:03,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12330 conditions, 5956 events. 4064/5956 cut-off events. For 1817/1817 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 35195 event pairs, 4064 based on Foata normal form. 0/4759 useless extension candidates. Maximal degree in co-relation 1964. Up to 5627 conditions per place. [2025-01-10 00:41:03,233 INFO L140 encePairwiseOnDemand]: 29/30 looper letters, 22 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-01-10 00:41:03,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 126 flow [2025-01-10 00:41:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:41:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:41:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2025-01-10 00:41:03,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 00:41:03,234 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 88 flow. Second operand 2 states and 35 transitions. [2025-01-10 00:41:03,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 126 flow [2025-01-10 00:41:03,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 120 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:03,239 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 76 flow [2025-01-10 00:41:03,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-01-10 00:41:03,240 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-01-10 00:41:03,240 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 76 flow [2025-01-10 00:41:03,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-01-10 00:41:03,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:03,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:41:03,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:41:03,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:03,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1828674070, now seen corresponding path program 1 times [2025-01-10 00:41:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630338181] [2025-01-10 00:41:03,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:03,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:41:03,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:41:03,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:03,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630338181] [2025-01-10 00:41:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630338181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:03,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:03,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464714211] [2025-01-10 00:41:03,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:03,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:03,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:03,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:03,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-01-10 00:41:03,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:03,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:03,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-01-10 00:41:03,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:04,515 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2025-01-10 00:41:04,516 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2025-01-10 00:41:04,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34713 conditions, 16840 events. 12243/16840 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90136 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 34706. Up to 10936 conditions per place. [2025-01-10 00:41:04,616 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-01-10 00:41:04,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 227 flow [2025-01-10 00:41:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-01-10 00:41:04,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 00:41:04,620 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 76 flow. Second operand 3 states and 54 transitions. [2025-01-10 00:41:04,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 227 flow [2025-01-10 00:41:04,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:04,626 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 114 flow [2025-01-10 00:41:04,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-01-10 00:41:04,629 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-01-10 00:41:04,629 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 114 flow [2025-01-10 00:41:04,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:04,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:04,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:04,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:41:04,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:04,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:04,631 INFO L85 PathProgramCache]: Analyzing trace with hash 699717791, now seen corresponding path program 1 times [2025-01-10 00:41:04,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:04,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400863048] [2025-01-10 00:41:04,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:04,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:41:04,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:41:04,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:04,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400863048] [2025-01-10 00:41:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400863048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202991351] [2025-01-10 00:41:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:04,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:04,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:04,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:04,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-01-10 00:41:04,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-10 00:41:04,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:04,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-01-10 00:41:04,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:06,139 INFO L124 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2025-01-10 00:41:06,140 INFO L125 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2025-01-10 00:41:06,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55877 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 133471 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 55868. Up to 15062 conditions per place. [2025-01-10 00:41:06,411 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-01-10 00:41:06,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 300 flow [2025-01-10 00:41:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-01-10 00:41:06,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-01-10 00:41:06,413 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 114 flow. Second operand 3 states and 53 transitions. [2025-01-10 00:41:06,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 300 flow [2025-01-10 00:41:06,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:06,466 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 172 flow [2025-01-10 00:41:06,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-01-10 00:41:06,467 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2025-01-10 00:41:06,467 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 172 flow [2025-01-10 00:41:06,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-10 00:41:06,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:06,467 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:06,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:41:06,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:06,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1900264205, now seen corresponding path program 1 times [2025-01-10 00:41:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:06,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699789365] [2025-01-10 00:41:06,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:06,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:41:06,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:41:06,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:06,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:06,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699789365] [2025-01-10 00:41:06,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699789365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:06,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:06,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640601586] [2025-01-10 00:41:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:06,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:06,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:06,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-01-10 00:41:06,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-01-10 00:41:06,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:06,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-01-10 00:41:06,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:07,923 INFO L124 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2025-01-10 00:41:07,923 INFO L125 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2025-01-10 00:41:08,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79821 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185206 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 79811. Up to 19502 conditions per place. [2025-01-10 00:41:08,165 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2025-01-10 00:41:08,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 409 flow [2025-01-10 00:41:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 00:41:08,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-01-10 00:41:08,167 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 172 flow. Second operand 3 states and 52 transitions. [2025-01-10 00:41:08,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 409 flow [2025-01-10 00:41:08,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:08,224 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 278 flow [2025-01-10 00:41:08,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-01-10 00:41:08,224 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2025-01-10 00:41:08,224 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 278 flow [2025-01-10 00:41:08,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-01-10 00:41:08,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:08,225 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:08,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:41:08,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:08,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2076669265, now seen corresponding path program 1 times [2025-01-10 00:41:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527320062] [2025-01-10 00:41:08,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:08,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:08,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:41:08,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:41:08,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:08,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527320062] [2025-01-10 00:41:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527320062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:41:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076479669] [2025-01-10 00:41:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:08,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:41:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:08,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:41:08,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:41:08,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-01-10 00:41:08,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-01-10 00:41:08,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:08,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-01-10 00:41:08,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:10,971 INFO L124 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2025-01-10 00:41:10,971 INFO L125 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2025-01-10 00:41:11,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150160 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 356739 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150149. Up to 16776 conditions per place. [2025-01-10 00:41:11,315 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2025-01-10 00:41:11,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 147 transitions, 1084 flow [2025-01-10 00:41:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:41:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:41:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-01-10 00:41:11,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 00:41:11,317 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 278 flow. Second operand 6 states and 120 transitions. [2025-01-10 00:41:11,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 147 transitions, 1084 flow [2025-01-10 00:41:11,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:11,486 INFO L231 Difference]: Finished difference. Result has 52 places, 70 transitions, 575 flow [2025-01-10 00:41:11,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=52, PETRI_TRANSITIONS=70} [2025-01-10 00:41:11,487 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2025-01-10 00:41:11,487 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 70 transitions, 575 flow [2025-01-10 00:41:11,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-01-10 00:41:11,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:11,487 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:41:11,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:11,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1881246501, now seen corresponding path program 2 times [2025-01-10 00:41:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911581576] [2025-01-10 00:41:11,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:41:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:11,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:41:11,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:41:11,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:41:11,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911581576] [2025-01-10 00:41:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911581576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:11,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:41:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021892077] [2025-01-10 00:41:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:11,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:41:11,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:11,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:41:11,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:41:11,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-01-10 00:41:11,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-01-10 00:41:11,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:11,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-01-10 00:41:11,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:14,824 INFO L124 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2025-01-10 00:41:14,824 INFO L125 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2025-01-10 00:41:15,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183312 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404680 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 183297. Up to 19534 conditions per place. [2025-01-10 00:41:15,401 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2025-01-10 00:41:15,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 179 transitions, 1515 flow [2025-01-10 00:41:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:41:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:41:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-01-10 00:41:15,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-10 00:41:15,402 INFO L175 Difference]: Start difference. First operand has 52 places, 70 transitions, 575 flow. Second operand 7 states and 135 transitions. [2025-01-10 00:41:15,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 179 transitions, 1515 flow [2025-01-10 00:41:15,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:15,628 INFO L231 Difference]: Finished difference. Result has 62 places, 95 transitions, 1039 flow [2025-01-10 00:41:15,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=62, PETRI_TRANSITIONS=95} [2025-01-10 00:41:15,629 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2025-01-10 00:41:15,629 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 95 transitions, 1039 flow [2025-01-10 00:41:15,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-01-10 00:41:15,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:15,629 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:15,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:41:15,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:15,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1221195100, now seen corresponding path program 1 times [2025-01-10 00:41:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:15,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827462848] [2025-01-10 00:41:15,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:15,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:41:15,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:41:15,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:15,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:15,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:41:15,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:41:15,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:41:15,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:15,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:15,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:41:15,644 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:41:15,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-10 00:41:15,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:41:15,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:41:15,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-01-10 00:41:15,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-01-10 00:41:15,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:41:15,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:41:15,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:41:15,646 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 00:41:15,646 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:41:15,646 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-10 00:41:15,667 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:15,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 112 flow [2025-01-10 00:41:15,675 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-01-10 00:41:15,675 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:41:15,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 56 events. 0/56 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-01-10 00:41:15,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 36 transitions, 112 flow [2025-01-10 00:41:15,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 112 flow [2025-01-10 00:41:15,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:15,678 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=None, 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;@2c2d17aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:15,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:41:15,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:15,679 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:41:15,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:15,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:15,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:41:15,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:41:15,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash 241241, now seen corresponding path program 1 times [2025-01-10 00:41:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:15,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356607183] [2025-01-10 00:41:15,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:15,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:15,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:41:15,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:41:15,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:15,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356607183] [2025-01-10 00:41:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356607183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:15,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:15,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:15,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934333855] [2025-01-10 00:41:15,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:15,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:41:15,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:15,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:41:15,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:41:15,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-01-10 00:41:15,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-01-10 00:41:15,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:15,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-01-10 00:41:15,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:17,203 INFO L124 PetriNetUnfolderBase]: 26564/36026 cut-off events. [2025-01-10 00:41:17,203 INFO L125 PetriNetUnfolderBase]: For 14312/14312 co-relation queries the response was YES. [2025-01-10 00:41:17,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74901 conditions, 36026 events. 26564/36026 cut-off events. For 14312/14312 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 226755 event pairs, 26564 based on Foata normal form. 0/28479 useless extension candidates. Maximal degree in co-relation 12478. Up to 34377 conditions per place. [2025-01-10 00:41:17,415 INFO L140 encePairwiseOnDemand]: 35/36 looper letters, 27 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-01-10 00:41:17,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 160 flow [2025-01-10 00:41:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:41:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:41:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2025-01-10 00:41:17,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 00:41:17,416 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 112 flow. Second operand 2 states and 42 transitions. [2025-01-10 00:41:17,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 160 flow [2025-01-10 00:41:17,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 33 transitions, 148 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:17,420 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 94 flow [2025-01-10 00:41:17,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-01-10 00:41:17,420 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-01-10 00:41:17,420 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 94 flow [2025-01-10 00:41:17,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-01-10 00:41:17,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:17,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:41:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:41:17,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:41:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1401144820, now seen corresponding path program 1 times [2025-01-10 00:41:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832051237] [2025-01-10 00:41:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:17,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:41:17,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:41:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832051237] [2025-01-10 00:41:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832051237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:17,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:17,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890863561] [2025-01-10 00:41:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:17,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:17,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:17,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:17,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:17,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-01-10 00:41:17,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:17,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:17,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-01-10 00:41:17,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:22,652 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2025-01-10 00:41:22,652 INFO L125 PetriNetUnfolderBase]: For 11167/11167 co-relation queries the response was YES. [2025-01-10 00:41:22,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258461 conditions, 126043 events. 97851/126043 cut-off events. For 11167/11167 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 716139 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 258453. Up to 84136 conditions per place. [2025-01-10 00:41:23,335 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-01-10 00:41:23,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 286 flow [2025-01-10 00:41:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-01-10 00:41:23,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 00:41:23,336 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 94 flow. Second operand 3 states and 66 transitions. [2025-01-10 00:41:23,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 286 flow [2025-01-10 00:41:23,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:23,345 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 140 flow [2025-01-10 00:41:23,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-01-10 00:41:23,345 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-01-10 00:41:23,345 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 140 flow [2025-01-10 00:41:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 00:41:23,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:23,346 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:41:23,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:41:23,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2110026086, now seen corresponding path program 1 times [2025-01-10 00:41:23,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:23,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441457917] [2025-01-10 00:41:23,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:23,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:41:23,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:41:23,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:23,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:23,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441457917] [2025-01-10 00:41:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441457917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:23,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:23,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920542755] [2025-01-10 00:41:23,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:23,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:23,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:23,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:23,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-01-10 00:41:23,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-10 00:41:23,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:23,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-01-10 00:41:23,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:31,718 INFO L124 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2025-01-10 00:41:31,718 INFO L125 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2025-01-10 00:41:32,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429057 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1083869 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 429047. Up to 121118 conditions per place. [2025-01-10 00:41:32,965 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2025-01-10 00:41:32,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 379 flow [2025-01-10 00:41:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-01-10 00:41:32,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2025-01-10 00:41:32,966 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 140 flow. Second operand 3 states and 65 transitions. [2025-01-10 00:41:32,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 379 flow [2025-01-10 00:41:34,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:34,668 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 216 flow [2025-01-10 00:41:34,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-01-10 00:41:34,668 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2025-01-10 00:41:34,668 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 216 flow [2025-01-10 00:41:34,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-10 00:41:34,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:34,669 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:34,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:41:34,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:41:34,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:34,669 INFO L85 PathProgramCache]: Analyzing trace with hash 505783182, now seen corresponding path program 1 times [2025-01-10 00:41:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:34,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916620699] [2025-01-10 00:41:34,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:41:34,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:41:34,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:34,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:34,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916620699] [2025-01-10 00:41:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916620699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:34,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:34,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:34,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397716131] [2025-01-10 00:41:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:34,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:34,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:34,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:34,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-01-10 00:41:34,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-01-10 00:41:34,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:34,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-01-10 00:41:34,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand