./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/triangular-longer-2.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/triangular-longer-2.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 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:11,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:11,513 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:38:11,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:11,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:11,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:11,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:11,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:11,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:11,551 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:11,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:11,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:11,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:11,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:11,553 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:11,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:11,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:11,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:11,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:11,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:11,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:11,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:11,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:11,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:11,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:11,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:11,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:11,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:11,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:11,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:11,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:11,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:11,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:11,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:11,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:11,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:11,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:11,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:11,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:11,557 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 -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2025-01-10 00:38:11,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:11,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:11,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:11,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:11,841 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:11,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-2.i [2025-01-10 00:38:13,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c1cf87ef/e2cbcc3991c646c1b31fe3ae34113a8b/FLAGb506a9107 [2025-01-10 00:38:13,619 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:13,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2025-01-10 00:38:13,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c1cf87ef/e2cbcc3991c646c1b31fe3ae34113a8b/FLAGb506a9107 [2025-01-10 00:38:13,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c1cf87ef/e2cbcc3991c646c1b31fe3ae34113a8b [2025-01-10 00:38:13,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:13,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:13,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:13,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:13,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:13,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:13" (1/1) ... [2025-01-10 00:38:13,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed1d811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:13, skipping insertion in model container [2025-01-10 00:38:13,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:13" (1/1) ... [2025-01-10 00:38:13,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:14,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:14,020 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:14,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:14,111 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:14,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14 WrapperNode [2025-01-10 00:38:14,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:14,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:14,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:14,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:14,121 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:38:14" (1/1) ... [2025-01-10 00:38:14,134 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:38:14" (1/1) ... [2025-01-10 00:38:14,154 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-01-10 00:38:14,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:14,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:14,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:14,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:14,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,180 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:38:14,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:14,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:14,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:14,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:14,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (1/1) ... [2025-01-10 00:38:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:14,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:14,234 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:38:14,242 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:38:14,262 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 00:38:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 00:38:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 00:38:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 00:38:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:38:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:38:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:14,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:14,265 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:38:14,377 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:14,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:14,493 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:14,494 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:14,570 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:14,571 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:38:14,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:14 BoogieIcfgContainer [2025-01-10 00:38:14,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:14,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:14,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:14,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:14,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:13" (1/3) ... [2025-01-10 00:38:14,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374b2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:14, skipping insertion in model container [2025-01-10 00:38:14,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:14" (2/3) ... [2025-01-10 00:38:14,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374b2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:14, skipping insertion in model container [2025-01-10 00:38:14,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:14" (3/3) ... [2025-01-10 00:38:14,583 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-01-10 00:38:14,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:14,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 00:38:14,598 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:14,641 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:14,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-01-10 00:38:14,704 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-10 00:38:14,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:14,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-10 00:38:14,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-01-10 00:38:14,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-01-10 00:38:14,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:14,733 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;@7958d01f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:14,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 00:38:14,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:14,748 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-01-10 00:38:14,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:14,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:14,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:14,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:14,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1254529802, now seen corresponding path program 1 times [2025-01-10 00:38:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285505474] [2025-01-10 00:38:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:14,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:38:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:38:14,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:14,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:14,973 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:38:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285505474] [2025-01-10 00:38:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285505474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:14,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905690748] [2025-01-10 00:38:14,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:14,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:14,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:15,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:15,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:15,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-10 00:38:15,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:38:15,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:15,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-10 00:38:15,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:15,105 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2025-01-10 00:38:15,106 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:38:15,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 553 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2025-01-10 00:38:15,112 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-01-10 00:38:15,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2025-01-10 00:38:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 00:38:15,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-01-10 00:38:15,128 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2025-01-10 00:38:15,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2025-01-10 00:38:15,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:15,139 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-01-10 00:38:15,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-01-10 00:38:15,146 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-01-10 00:38:15,148 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-01-10 00:38:15,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:38:15,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:15,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:15,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:15,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1254530874, now seen corresponding path program 1 times [2025-01-10 00:38:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198731636] [2025-01-10 00:38:15,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:15,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:38:15,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:38:15,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:15,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:15,418 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:38:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198731636] [2025-01-10 00:38:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198731636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:38:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229477025] [2025-01-10 00:38:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:15,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:38:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:15,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:38:15,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:38:15,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:15,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:38:15,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:15,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:15,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:15,746 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2025-01-10 00:38:15,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:15,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 593 events. 328/593 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2602 event pairs, 45 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 1120. Up to 243 conditions per place. [2025-01-10 00:38:15,754 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2025-01-10 00:38:15,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2025-01-10 00:38:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:38:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:38:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2025-01-10 00:38:15,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2025-01-10 00:38:15,758 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2025-01-10 00:38:15,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2025-01-10 00:38:15,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:15,762 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2025-01-10 00:38:15,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2025-01-10 00:38:15,764 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2025-01-10 00:38:15,764 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2025-01-10 00:38:15,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:38:15,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:15,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:15,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:15,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 211623279, now seen corresponding path program 1 times [2025-01-10 00:38:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999373241] [2025-01-10 00:38:15,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:15,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:38:15,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:38:15,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:15,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:15,940 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:38:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999373241] [2025-01-10 00:38:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999373241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:15,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:15,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:38:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308434641] [2025-01-10 00:38:15,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:15,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:15,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:15,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:15,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:15,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:38:15,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:15,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:15,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:16,151 INFO L124 PetriNetUnfolderBase]: 247/454 cut-off events. [2025-01-10 00:38:16,152 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2025-01-10 00:38:16,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 454 events. 247/454 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1835 event pairs, 63 based on Foata normal form. 18/466 useless extension candidates. Maximal degree in co-relation 1170. Up to 190 conditions per place. [2025-01-10 00:38:16,157 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 27 selfloop transitions, 8 changer transitions 15/54 dead transitions. [2025-01-10 00:38:16,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 294 flow [2025-01-10 00:38:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:38:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:38:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2025-01-10 00:38:16,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-01-10 00:38:16,161 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 6 states and 94 transitions. [2025-01-10 00:38:16,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 294 flow [2025-01-10 00:38:16,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 290 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:16,169 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 144 flow [2025-01-10 00:38:16,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2025-01-10 00:38:16,171 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2025-01-10 00:38:16,171 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 144 flow [2025-01-10 00:38:16,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:38:16,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:16,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:16,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:16,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:16,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1511542372, now seen corresponding path program 1 times [2025-01-10 00:38:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072380608] [2025-01-10 00:38:16,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:16,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:38:16,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:38:16,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:16,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:16,312 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:38:16,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:16,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072380608] [2025-01-10 00:38:16,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072380608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:16,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:16,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:38:16,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851744613] [2025-01-10 00:38:16,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:16,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:16,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:16,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:16,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:16,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:38:16,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:16,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:16,573 INFO L124 PetriNetUnfolderBase]: 391/725 cut-off events. [2025-01-10 00:38:16,573 INFO L125 PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES. [2025-01-10 00:38:16,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 725 events. 391/725 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3200 event pairs, 95 based on Foata normal form. 27/748 useless extension candidates. Maximal degree in co-relation 2114. Up to 264 conditions per place. [2025-01-10 00:38:16,580 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2025-01-10 00:38:16,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 518 flow [2025-01-10 00:38:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:38:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:38:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-01-10 00:38:16,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-01-10 00:38:16,584 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 144 flow. Second operand 9 states and 144 transitions. [2025-01-10 00:38:16,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 518 flow [2025-01-10 00:38:16,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 82 transitions, 476 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-01-10 00:38:16,592 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 240 flow [2025-01-10 00:38:16,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-01-10 00:38:16,594 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-01-10 00:38:16,594 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 240 flow [2025-01-10 00:38:16,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:38:16,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:16,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:16,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:16,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1394530660, now seen corresponding path program 2 times [2025-01-10 00:38:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119944965] [2025-01-10 00:38:16,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:16,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:38:16,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:38:16,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:16,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:16,709 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:38:16,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:16,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119944965] [2025-01-10 00:38:16,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119944965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:16,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:16,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:38:16,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258858648] [2025-01-10 00:38:16,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:16,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:16,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:16,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:16,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:16,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:16,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:38:16,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:16,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:16,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:16,948 INFO L124 PetriNetUnfolderBase]: 328/611 cut-off events. [2025-01-10 00:38:16,948 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2025-01-10 00:38:16,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 611 events. 328/611 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2576 event pairs, 95 based on Foata normal form. 45/652 useless extension candidates. Maximal degree in co-relation 2027. Up to 234 conditions per place. [2025-01-10 00:38:16,953 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 11 changer transitions 28/81 dead transitions. [2025-01-10 00:38:16,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 81 transitions, 612 flow [2025-01-10 00:38:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:38:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:38:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-01-10 00:38:16,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2025-01-10 00:38:16,957 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 240 flow. Second operand 8 states and 127 transitions. [2025-01-10 00:38:16,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 81 transitions, 612 flow [2025-01-10 00:38:16,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 568 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:16,968 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 271 flow [2025-01-10 00:38:16,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=271, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2025-01-10 00:38:16,970 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-01-10 00:38:16,973 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 271 flow [2025-01-10 00:38:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:38:16,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:16,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:16,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -511388409, now seen corresponding path program 1 times [2025-01-10 00:38:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84240933] [2025-01-10 00:38:16,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:16,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:38:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:38:16,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:16,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:17,089 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:38:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84240933] [2025-01-10 00:38:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84240933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:38:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88594454] [2025-01-10 00:38:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:38:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:17,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:38:17,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:38:17,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:17,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:38:17,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:17,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:17,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:17,356 INFO L124 PetriNetUnfolderBase]: 364/670 cut-off events. [2025-01-10 00:38:17,356 INFO L125 PetriNetUnfolderBase]: For 2964/2964 co-relation queries the response was YES. [2025-01-10 00:38:17,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 670 events. 364/670 cut-off events. For 2964/2964 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2789 event pairs, 65 based on Foata normal form. 27/691 useless extension candidates. Maximal degree in co-relation 2397. Up to 148 conditions per place. [2025-01-10 00:38:17,360 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 18 changer transitions 28/90 dead transitions. [2025-01-10 00:38:17,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 715 flow [2025-01-10 00:38:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:38:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:38:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-01-10 00:38:17,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-01-10 00:38:17,362 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 271 flow. Second operand 10 states and 155 transitions. [2025-01-10 00:38:17,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 715 flow [2025-01-10 00:38:17,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 646 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-01-10 00:38:17,369 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 350 flow [2025-01-10 00:38:17,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2025-01-10 00:38:17,370 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2025-01-10 00:38:17,370 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 350 flow [2025-01-10 00:38:17,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:38:17,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:17,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:17,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:38:17,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1117680137, now seen corresponding path program 2 times [2025-01-10 00:38:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821089617] [2025-01-10 00:38:17,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:17,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:38:17,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:38:17,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:17,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:17,501 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:38:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821089617] [2025-01-10 00:38:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821089617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:17,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:38:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262453222] [2025-01-10 00:38:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:17,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:38:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:17,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:38:17,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:38:17,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:17,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:38:17,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:17,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:17,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:17,795 INFO L124 PetriNetUnfolderBase]: 391/719 cut-off events. [2025-01-10 00:38:17,795 INFO L125 PetriNetUnfolderBase]: For 3901/3901 co-relation queries the response was YES. [2025-01-10 00:38:17,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 719 events. 391/719 cut-off events. For 3901/3901 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3111 event pairs, 104 based on Foata normal form. 18/733 useless extension candidates. Maximal degree in co-relation 2771. Up to 327 conditions per place. [2025-01-10 00:38:17,801 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 49 selfloop transitions, 16 changer transitions 25/94 dead transitions. [2025-01-10 00:38:17,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 800 flow [2025-01-10 00:38:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:38:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:38:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-01-10 00:38:17,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2025-01-10 00:38:17,804 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 350 flow. Second operand 11 states and 168 transitions. [2025-01-10 00:38:17,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 800 flow [2025-01-10 00:38:17,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 720 flow, removed 32 selfloop flow, removed 6 redundant places. [2025-01-10 00:38:17,816 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 381 flow [2025-01-10 00:38:17,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=381, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2025-01-10 00:38:17,818 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-01-10 00:38:17,818 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 381 flow [2025-01-10 00:38:17,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:38:17,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:17,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:17,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:38:17,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:17,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 728554816, now seen corresponding path program 1 times [2025-01-10 00:38:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988806176] [2025-01-10 00:38:17,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:17,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:38:17,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:38:17,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:17,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:17,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:17,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988806176] [2025-01-10 00:38:17,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988806176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:17,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223352733] [2025-01-10 00:38:17,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:17,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:17,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:17,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:38:18,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:38:18,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:38:18,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:18,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:18,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 00:38:18,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:18,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223352733] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:18,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:38:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634826482] [2025-01-10 00:38:18,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:38:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:18,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:38:18,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:38:18,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:18,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 381 flow. Second operand has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 14 states have internal predecessors, (141), 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:38:18,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:18,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:18,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:18,842 INFO L124 PetriNetUnfolderBase]: 625/1129 cut-off events. [2025-01-10 00:38:18,842 INFO L125 PetriNetUnfolderBase]: For 7743/7743 co-relation queries the response was YES. [2025-01-10 00:38:18,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4595 conditions, 1129 events. 625/1129 cut-off events. For 7743/7743 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4767 event pairs, 59 based on Foata normal form. 45/1168 useless extension candidates. Maximal degree in co-relation 4564. Up to 182 conditions per place. [2025-01-10 00:38:18,848 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 65 selfloop transitions, 33 changer transitions 56/158 dead transitions. [2025-01-10 00:38:18,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 158 transitions, 1433 flow [2025-01-10 00:38:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 00:38:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 00:38:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 293 transitions. [2025-01-10 00:38:18,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5317604355716878 [2025-01-10 00:38:18,850 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 381 flow. Second operand 19 states and 293 transitions. [2025-01-10 00:38:18,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 158 transitions, 1433 flow [2025-01-10 00:38:18,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 158 transitions, 1356 flow, removed 28 selfloop flow, removed 7 redundant places. [2025-01-10 00:38:18,863 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 698 flow [2025-01-10 00:38:18,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=698, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2025-01-10 00:38:18,864 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2025-01-10 00:38:18,864 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 698 flow [2025-01-10 00:38:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 14 states have internal predecessors, (141), 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:38:18,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:18,865 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:18,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:38:19,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:19,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:19,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash 861686406, now seen corresponding path program 1 times [2025-01-10 00:38:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:19,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383261691] [2025-01-10 00:38:19,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:19,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:38:19,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:38:19,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:19,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383261691] [2025-01-10 00:38:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383261691] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61056261] [2025-01-10 00:38:19,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:19,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:19,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:38:19,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:38:19,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:38:19,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:19,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:38:19,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:19,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:19,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61056261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:19,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-10 00:38:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151522128] [2025-01-10 00:38:19,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:38:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:19,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:38:19,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:38:19,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:19,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 60 transitions, 698 flow. Second operand has 17 states, 17 states have (on average 10.294117647058824) internal successors, (175), 17 states have internal predecessors, (175), 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:38:19,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:19,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:19,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:20,293 INFO L124 PetriNetUnfolderBase]: 823/1541 cut-off events. [2025-01-10 00:38:20,293 INFO L125 PetriNetUnfolderBase]: For 19489/19489 co-relation queries the response was YES. [2025-01-10 00:38:20,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7262 conditions, 1541 events. 823/1541 cut-off events. For 19489/19489 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6683 event pairs, 203 based on Foata normal form. 81/1618 useless extension candidates. Maximal degree in co-relation 7224. Up to 720 conditions per place. [2025-01-10 00:38:20,304 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 92 selfloop transitions, 25 changer transitions 89/210 dead transitions. [2025-01-10 00:38:20,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 210 transitions, 2368 flow [2025-01-10 00:38:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 00:38:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 00:38:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 376 transitions. [2025-01-10 00:38:20,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5186206896551724 [2025-01-10 00:38:20,307 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 698 flow. Second operand 25 states and 376 transitions. [2025-01-10 00:38:20,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 210 transitions, 2368 flow [2025-01-10 00:38:20,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 210 transitions, 1865 flow, removed 237 selfloop flow, removed 10 redundant places. [2025-01-10 00:38:20,331 INFO L231 Difference]: Finished difference. Result has 115 places, 74 transitions, 785 flow [2025-01-10 00:38:20,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=785, PETRI_PLACES=115, PETRI_TRANSITIONS=74} [2025-01-10 00:38:20,331 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2025-01-10 00:38:20,332 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 74 transitions, 785 flow [2025-01-10 00:38:20,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.294117647058824) internal successors, (175), 17 states have internal predecessors, (175), 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:38:20,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:20,332 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:20,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:38:20,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:20,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:20,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1631274408, now seen corresponding path program 2 times [2025-01-10 00:38:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374983447] [2025-01-10 00:38:20,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:20,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 00:38:20,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:38:20,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:38:20,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:20,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374983447] [2025-01-10 00:38:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374983447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760756625] [2025-01-10 00:38:20,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:20,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:20,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:38:20,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 00:38:20,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:38:20,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:38:20,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:20,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:38:20,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:20,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:21,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760756625] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:21,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:21,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-10 00:38:21,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212457761] [2025-01-10 00:38:21,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:38:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:21,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:38:21,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:38:21,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:21,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 74 transitions, 785 flow. Second operand has 17 states, 17 states have (on average 10.352941176470589) internal successors, (176), 17 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:21,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:21,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:21,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:21,943 INFO L124 PetriNetUnfolderBase]: 1435/2726 cut-off events. [2025-01-10 00:38:21,944 INFO L125 PetriNetUnfolderBase]: For 66366/66366 co-relation queries the response was YES. [2025-01-10 00:38:21,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14602 conditions, 2726 events. 1435/2726 cut-off events. For 66366/66366 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14692 event pairs, 138 based on Foata normal form. 81/2803 useless extension candidates. Maximal degree in co-relation 14550. Up to 484 conditions per place. [2025-01-10 00:38:21,966 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 127 selfloop transitions, 80 changer transitions 91/302 dead transitions. [2025-01-10 00:38:21,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 302 transitions, 3861 flow [2025-01-10 00:38:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-10 00:38:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-01-10 00:38:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 489 transitions. [2025-01-10 00:38:21,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269396551724138 [2025-01-10 00:38:21,969 INFO L175 Difference]: Start difference. First operand has 115 places, 74 transitions, 785 flow. Second operand 32 states and 489 transitions. [2025-01-10 00:38:21,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 302 transitions, 3861 flow [2025-01-10 00:38:22,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 302 transitions, 3247 flow, removed 299 selfloop flow, removed 13 redundant places. [2025-01-10 00:38:22,034 INFO L231 Difference]: Finished difference. Result has 147 places, 120 transitions, 1594 flow [2025-01-10 00:38:22,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1594, PETRI_PLACES=147, PETRI_TRANSITIONS=120} [2025-01-10 00:38:22,034 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2025-01-10 00:38:22,035 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 120 transitions, 1594 flow [2025-01-10 00:38:22,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.352941176470589) internal successors, (176), 17 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:22,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:22,035 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:22,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:38:22,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:22,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:22,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:22,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1132377716, now seen corresponding path program 3 times [2025-01-10 00:38:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:22,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463265806] [2025-01-10 00:38:22,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:38:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:22,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-10 00:38:22,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:38:22,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 00:38:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463265806] [2025-01-10 00:38:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463265806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541132091] [2025-01-10 00:38:22,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:38:22,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:22,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:22,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:22,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:38:22,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-10 00:38:22,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:38:22,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 00:38:22,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:22,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 00:38:22,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:22,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541132091] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:22,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-01-10 00:38:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470448108] [2025-01-10 00:38:22,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:38:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:22,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:38:22,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:38:22,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:22,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 120 transitions, 1594 flow. Second operand has 18 states, 18 states have (on average 10.277777777777779) internal successors, (185), 18 states have internal predecessors, (185), 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:38:22,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:22,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:22,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:24,014 INFO L124 PetriNetUnfolderBase]: 1822/3435 cut-off events. [2025-01-10 00:38:24,014 INFO L125 PetriNetUnfolderBase]: For 152114/152114 co-relation queries the response was YES. [2025-01-10 00:38:24,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21739 conditions, 3435 events. 1822/3435 cut-off events. For 152114/152114 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 19309 event pairs, 58 based on Foata normal form. 117/3548 useless extension candidates. Maximal degree in co-relation 21672. Up to 509 conditions per place. [2025-01-10 00:38:24,054 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 124 selfloop transitions, 121 changer transitions 115/364 dead transitions. [2025-01-10 00:38:24,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 364 transitions, 5825 flow [2025-01-10 00:38:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-10 00:38:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-01-10 00:38:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2025-01-10 00:38:24,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-01-10 00:38:24,056 INFO L175 Difference]: Start difference. First operand has 147 places, 120 transitions, 1594 flow. Second operand 36 states and 551 transitions. [2025-01-10 00:38:24,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 364 transitions, 5825 flow [2025-01-10 00:38:24,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 364 transitions, 4925 flow, removed 436 selfloop flow, removed 16 redundant places. [2025-01-10 00:38:24,413 INFO L231 Difference]: Finished difference. Result has 180 places, 155 transitions, 2414 flow [2025-01-10 00:38:24,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2414, PETRI_PLACES=180, PETRI_TRANSITIONS=155} [2025-01-10 00:38:24,415 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2025-01-10 00:38:24,415 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 155 transitions, 2414 flow [2025-01-10 00:38:24,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.277777777777779) internal successors, (185), 18 states have internal predecessors, (185), 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:38:24,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:24,416 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:24,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:38:24,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 00:38:24,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1656984379, now seen corresponding path program 4 times [2025-01-10 00:38:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116672819] [2025-01-10 00:38:24,621 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:38:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:24,627 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-10 00:38:24,634 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:38:24,636 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:38:24,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:24,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116672819] [2025-01-10 00:38:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116672819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5782833] [2025-01-10 00:38:24,849 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:38:24,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:24,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:24,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:38:24,888 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-10 00:38:24,902 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:38:24,903 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:38:24,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:24,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 00:38:24,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:24,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5782833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:25,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-10 00:38:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900243482] [2025-01-10 00:38:25,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:25,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:38:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:25,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:38:25,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-01-10 00:38:25,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:25,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 155 transitions, 2414 flow. Second operand has 26 states, 26 states have (on average 10.038461538461538) internal successors, (261), 26 states have internal predecessors, (261), 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:38:25,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:25,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:25,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:27,059 INFO L124 PetriNetUnfolderBase]: 2632/4901 cut-off events. [2025-01-10 00:38:27,059 INFO L125 PetriNetUnfolderBase]: For 333691/333691 co-relation queries the response was YES. [2025-01-10 00:38:27,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37125 conditions, 4901 events. 2632/4901 cut-off events. For 333691/333691 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 26519 event pairs, 89 based on Foata normal form. 99/4994 useless extension candidates. Maximal degree in co-relation 37044. Up to 780 conditions per place. [2025-01-10 00:38:27,111 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 164 selfloop transitions, 176 changer transitions 146/490 dead transitions. [2025-01-10 00:38:27,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 490 transitions, 9879 flow [2025-01-10 00:38:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-10 00:38:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-01-10 00:38:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 749 transitions. [2025-01-10 00:38:27,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5270935960591133 [2025-01-10 00:38:27,114 INFO L175 Difference]: Start difference. First operand has 180 places, 155 transitions, 2414 flow. Second operand 49 states and 749 transitions. [2025-01-10 00:38:27,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 490 transitions, 9879 flow [2025-01-10 00:38:27,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 490 transitions, 8173 flow, removed 823 selfloop flow, removed 20 redundant places. [2025-01-10 00:38:27,613 INFO L231 Difference]: Finished difference. Result has 230 places, 216 transitions, 3912 flow [2025-01-10 00:38:27,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=3912, PETRI_PLACES=230, PETRI_TRANSITIONS=216} [2025-01-10 00:38:27,613 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2025-01-10 00:38:27,613 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 216 transitions, 3912 flow [2025-01-10 00:38:27,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.038461538461538) internal successors, (261), 26 states have internal predecessors, (261), 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:38:27,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:27,614 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:27,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:38:27,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 00:38:27,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:27,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:27,817 INFO L85 PathProgramCache]: Analyzing trace with hash 712127566, now seen corresponding path program 5 times [2025-01-10 00:38:27,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:27,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345319280] [2025-01-10 00:38:27,817 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:38:27,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:27,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 8 equivalence classes. [2025-01-10 00:38:27,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:27,837 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-10 00:38:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345319280] [2025-01-10 00:38:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345319280] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769835983] [2025-01-10 00:38:28,236 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:38:28,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:28,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:28,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:28,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:38:28,279 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 8 equivalence classes. [2025-01-10 00:38:28,301 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:28,302 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-10 00:38:28,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:28,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:38:28,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:28,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769835983] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:28,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:28,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2025-01-10 00:38:28,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281374871] [2025-01-10 00:38:28,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:28,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-10 00:38:28,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:28,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-10 00:38:28,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2025-01-10 00:38:28,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:28,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 216 transitions, 3912 flow. Second operand has 41 states, 41 states have (on average 10.121951219512194) internal successors, (415), 41 states have internal predecessors, (415), 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:38:28,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:28,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:28,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:30,528 INFO L124 PetriNetUnfolderBase]: 2704/5168 cut-off events. [2025-01-10 00:38:30,528 INFO L125 PetriNetUnfolderBase]: For 521278/521278 co-relation queries the response was YES. [2025-01-10 00:38:30,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42822 conditions, 5168 events. 2704/5168 cut-off events. For 521278/521278 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 29193 event pairs, 1013 based on Foata normal form. 63/5227 useless extension candidates. Maximal degree in co-relation 42719. Up to 3618 conditions per place. [2025-01-10 00:38:30,578 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 261 selfloop transitions, 45 changer transitions 95/405 dead transitions. [2025-01-10 00:38:30,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 405 transitions, 9268 flow [2025-01-10 00:38:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-10 00:38:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-10 00:38:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 484 transitions. [2025-01-10 00:38:30,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2025-01-10 00:38:30,580 INFO L175 Difference]: Start difference. First operand has 230 places, 216 transitions, 3912 flow. Second operand 33 states and 484 transitions. [2025-01-10 00:38:30,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 405 transitions, 9268 flow [2025-01-10 00:38:31,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 405 transitions, 6769 flow, removed 1228 selfloop flow, removed 17 redundant places. [2025-01-10 00:38:31,419 INFO L231 Difference]: Finished difference. Result has 249 places, 232 transitions, 3422 flow [2025-01-10 00:38:31,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2799, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3422, PETRI_PLACES=249, PETRI_TRANSITIONS=232} [2025-01-10 00:38:31,420 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2025-01-10 00:38:31,420 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 232 transitions, 3422 flow [2025-01-10 00:38:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 10.121951219512194) internal successors, (415), 41 states have internal predecessors, (415), 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:38:31,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:31,420 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:31,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:38:31,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 00:38:31,621 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:31,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash 276439076, now seen corresponding path program 6 times [2025-01-10 00:38:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287087515] [2025-01-10 00:38:31,622 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:38:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:31,628 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 7 equivalence classes. [2025-01-10 00:38:31,636 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:31,637 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-10 00:38:31,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:32,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287087515] [2025-01-10 00:38:32,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287087515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:32,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860979353] [2025-01-10 00:38:32,024 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:38:32,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:32,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:32,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:32,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:38:32,066 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 7 equivalence classes. [2025-01-10 00:38:32,091 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:32,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-10 00:38:32,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:32,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:38:32,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:32,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:38:32,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860979353] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:32,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:32,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2025-01-10 00:38:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592669100] [2025-01-10 00:38:32,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:32,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-10 00:38:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:32,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-10 00:38:32,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2025-01-10 00:38:32,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:32,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 232 transitions, 3422 flow. Second operand has 41 states, 41 states have (on average 10.121951219512194) internal successors, (415), 41 states have internal predecessors, (415), 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:38:32,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:32,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:32,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:34,902 INFO L124 PetriNetUnfolderBase]: 3208/6321 cut-off events. [2025-01-10 00:38:34,902 INFO L125 PetriNetUnfolderBase]: For 504237/504237 co-relation queries the response was YES. [2025-01-10 00:38:34,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46499 conditions, 6321 events. 3208/6321 cut-off events. For 504237/504237 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 37960 event pairs, 596 based on Foata normal form. 63/6380 useless extension candidates. Maximal degree in co-relation 46391. Up to 2398 conditions per place. [2025-01-10 00:38:34,975 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 265 selfloop transitions, 165 changer transitions 135/569 dead transitions. [2025-01-10 00:38:34,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 569 transitions, 10301 flow [2025-01-10 00:38:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-10 00:38:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-01-10 00:38:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 773 transitions. [2025-01-10 00:38:34,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5029277813923227 [2025-01-10 00:38:34,978 INFO L175 Difference]: Start difference. First operand has 249 places, 232 transitions, 3422 flow. Second operand 53 states and 773 transitions. [2025-01-10 00:38:34,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 569 transitions, 10301 flow [2025-01-10 00:38:35,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 569 transitions, 9542 flow, removed 354 selfloop flow, removed 21 redundant places. [2025-01-10 00:38:35,722 INFO L231 Difference]: Finished difference. Result has 292 places, 288 transitions, 4594 flow [2025-01-10 00:38:35,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4594, PETRI_PLACES=292, PETRI_TRANSITIONS=288} [2025-01-10 00:38:35,723 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 262 predicate places. [2025-01-10 00:38:35,723 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 288 transitions, 4594 flow [2025-01-10 00:38:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 10.121951219512194) internal successors, (415), 41 states have internal predecessors, (415), 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:38:35,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:35,723 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:35,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:38:35,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:35,924 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:35,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1748519790, now seen corresponding path program 7 times [2025-01-10 00:38:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:35,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971538919] [2025-01-10 00:38:35,925 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 00:38:35,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:35,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 00:38:35,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:35,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:35,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971538919] [2025-01-10 00:38:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971538919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496465008] [2025-01-10 00:38:36,365 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 00:38:36,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:36,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:36,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:36,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:38:36,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 00:38:36,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:36,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:36,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:36,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:38:36,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 1 proven. 96 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:36,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496465008] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:37,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2025-01-10 00:38:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636922716] [2025-01-10 00:38:37,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:37,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-10 00:38:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:37,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-10 00:38:37,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1446, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 00:38:37,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:37,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 288 transitions, 4594 flow. Second operand has 42 states, 42 states have (on average 10.142857142857142) internal successors, (426), 42 states have internal predecessors, (426), 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:38:37,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:37,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:37,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:40,161 INFO L124 PetriNetUnfolderBase]: 4099/8338 cut-off events. [2025-01-10 00:38:40,161 INFO L125 PetriNetUnfolderBase]: For 858935/858935 co-relation queries the response was YES. [2025-01-10 00:38:40,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68156 conditions, 8338 events. 4099/8338 cut-off events. For 858935/858935 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 54693 event pairs, 288 based on Foata normal form. 81/8415 useless extension candidates. Maximal degree in co-relation 68035. Up to 1731 conditions per place. [2025-01-10 00:38:40,248 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 239 selfloop transitions, 309 changer transitions 157/709 dead transitions. [2025-01-10 00:38:40,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 709 transitions, 14418 flow [2025-01-10 00:38:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-10 00:38:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-01-10 00:38:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 871 transitions. [2025-01-10 00:38:40,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5090590298071304 [2025-01-10 00:38:40,250 INFO L175 Difference]: Start difference. First operand has 292 places, 288 transitions, 4594 flow. Second operand 59 states and 871 transitions. [2025-01-10 00:38:40,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 709 transitions, 14418 flow [2025-01-10 00:38:41,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 709 transitions, 12941 flow, removed 640 selfloop flow, removed 29 redundant places. [2025-01-10 00:38:41,820 INFO L231 Difference]: Finished difference. Result has 337 places, 385 transitions, 6807 flow [2025-01-10 00:38:41,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3833, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=6807, PETRI_PLACES=337, PETRI_TRANSITIONS=385} [2025-01-10 00:38:41,821 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 307 predicate places. [2025-01-10 00:38:41,821 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 385 transitions, 6807 flow [2025-01-10 00:38:41,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 10.142857142857142) internal successors, (426), 42 states have internal predecessors, (426), 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:38:41,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:41,821 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:41,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:38:42,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 00:38:42,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:42,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1191376846, now seen corresponding path program 8 times [2025-01-10 00:38:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:42,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472649427] [2025-01-10 00:38:42,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:42,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:42,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-01-10 00:38:42,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:42,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:38:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472649427] [2025-01-10 00:38:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472649427] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038738994] [2025-01-10 00:38:42,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:42,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:42,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:42,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:38:42,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-01-10 00:38:42,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:42,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:38:42,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:42,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:38:42,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:42,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038738994] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:42,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2025-01-10 00:38:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509882241] [2025-01-10 00:38:42,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:42,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-10 00:38:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:42,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-10 00:38:42,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2025-01-10 00:38:42,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:42,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 385 transitions, 6807 flow. Second operand has 41 states, 41 states have (on average 10.146341463414634) internal successors, (416), 41 states have internal predecessors, (416), 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:38:42,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:42,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:42,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:46,403 INFO L124 PetriNetUnfolderBase]: 5143/10450 cut-off events. [2025-01-10 00:38:46,403 INFO L125 PetriNetUnfolderBase]: For 1483460/1483460 co-relation queries the response was YES. [2025-01-10 00:38:46,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95113 conditions, 10450 events. 5143/10450 cut-off events. For 1483460/1483460 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 72316 event pairs, 150 based on Foata normal form. 81/10527 useless extension candidates. Maximal degree in co-relation 94975. Up to 2283 conditions per place. [2025-01-10 00:38:46,509 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 222 selfloop transitions, 422 changer transitions 157/805 dead transitions. [2025-01-10 00:38:46,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 805 transitions, 17658 flow [2025-01-10 00:38:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-10 00:38:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-01-10 00:38:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 881 transitions. [2025-01-10 00:38:46,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5149035651665692 [2025-01-10 00:38:46,512 INFO L175 Difference]: Start difference. First operand has 337 places, 385 transitions, 6807 flow. Second operand 59 states and 881 transitions. [2025-01-10 00:38:46,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 805 transitions, 17658 flow [2025-01-10 00:38:49,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 805 transitions, 15017 flow, removed 1172 selfloop flow, removed 31 redundant places. [2025-01-10 00:38:49,374 INFO L231 Difference]: Finished difference. Result has 381 places, 481 transitions, 8705 flow [2025-01-10 00:38:49,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=5370, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=8705, PETRI_PLACES=381, PETRI_TRANSITIONS=481} [2025-01-10 00:38:49,375 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 351 predicate places. [2025-01-10 00:38:49,375 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 481 transitions, 8705 flow [2025-01-10 00:38:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 10.146341463414634) internal successors, (416), 41 states have internal predecessors, (416), 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:38:49,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:49,375 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:49,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 00:38:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:49,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1828296842, now seen corresponding path program 9 times [2025-01-10 00:38:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307946008] [2025-01-10 00:38:49,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:38:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:49,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 6 equivalence classes. [2025-01-10 00:38:49,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:49,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 00:38:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:49,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307946008] [2025-01-10 00:38:49,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307946008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:49,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725192470] [2025-01-10 00:38:49,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:38:49,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:49,885 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:49,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:38:49,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 6 equivalence classes. [2025-01-10 00:38:49,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:38:49,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 00:38:49,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:49,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:38:49,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:50,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725192470] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:50,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:50,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2025-01-10 00:38:50,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959281412] [2025-01-10 00:38:50,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:50,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-10 00:38:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:50,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-10 00:38:50,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 00:38:50,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:38:50,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 481 transitions, 8705 flow. Second operand has 42 states, 42 states have (on average 10.142857142857142) internal successors, (426), 42 states have internal predecessors, (426), 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:38:50,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:50,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:38:50,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:54,244 INFO L124 PetriNetUnfolderBase]: 5917/11886 cut-off events. [2025-01-10 00:38:54,245 INFO L125 PetriNetUnfolderBase]: For 1948012/1948012 co-relation queries the response was YES. [2025-01-10 00:38:54,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114536 conditions, 11886 events. 5917/11886 cut-off events. For 1948012/1948012 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 83737 event pairs, 66 based on Foata normal form. 90/11972 useless extension candidates. Maximal degree in co-relation 114380. Up to 2604 conditions per place. [2025-01-10 00:38:54,377 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 216 selfloop transitions, 494 changer transitions 162/876 dead transitions. [2025-01-10 00:38:54,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 876 transitions, 20168 flow [2025-01-10 00:38:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-10 00:38:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-01-10 00:38:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 907 transitions. [2025-01-10 00:38:54,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.521264367816092 [2025-01-10 00:38:54,380 INFO L175 Difference]: Start difference. First operand has 381 places, 481 transitions, 8705 flow. Second operand 60 states and 907 transitions. [2025-01-10 00:38:54,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 876 transitions, 20168 flow [2025-01-10 00:38:59,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 876 transitions, 17634 flow, removed 1081 selfloop flow, removed 34 redundant places. [2025-01-10 00:38:59,546 INFO L231 Difference]: Finished difference. Result has 420 places, 540 transitions, 10205 flow [2025-01-10 00:38:59,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=7085, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=10205, PETRI_PLACES=420, PETRI_TRANSITIONS=540} [2025-01-10 00:38:59,547 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 390 predicate places. [2025-01-10 00:38:59,547 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 540 transitions, 10205 flow [2025-01-10 00:38:59,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 10.142857142857142) internal successors, (426), 42 states have internal predecessors, (426), 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:38:59,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:59,547 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:59,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:38:59,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 00:38:59,748 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:38:59,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1918255329, now seen corresponding path program 10 times [2025-01-10 00:38:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245243700] [2025-01-10 00:38:59,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:38:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:59,756 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-01-10 00:38:59,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 00:38:59,764 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:38:59,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:39:00,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:00,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245243700] [2025-01-10 00:39:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245243700] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:00,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941109328] [2025-01-10 00:39:00,147 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:39:00,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:00,150 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:00,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:39:00,189 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-01-10 00:39:00,208 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 00:39:00,209 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:39:00,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:00,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:39:00,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:39:00,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:39:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:39:00,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941109328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:39:00,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:39:00,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2025-01-10 00:39:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177650566] [2025-01-10 00:39:00,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:39:00,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-10 00:39:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:00,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-10 00:39:00,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2025-01-10 00:39:00,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:00,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 540 transitions, 10205 flow. Second operand has 43 states, 43 states have (on average 10.116279069767442) internal successors, (435), 43 states have internal predecessors, (435), 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:39:00,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:00,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:00,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:04,594 INFO L124 PetriNetUnfolderBase]: 6052/12227 cut-off events. [2025-01-10 00:39:04,594 INFO L125 PetriNetUnfolderBase]: For 2427698/2427698 co-relation queries the response was YES. [2025-01-10 00:39:04,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124308 conditions, 12227 events. 6052/12227 cut-off events. For 2427698/2427698 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 86822 event pairs, 203 based on Foata normal form. 27/12248 useless extension candidates. Maximal degree in co-relation 124138. Up to 2658 conditions per place. [2025-01-10 00:39:04,739 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 224 selfloop transitions, 479 changer transitions 87/794 dead transitions. [2025-01-10 00:39:04,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 794 transitions, 18273 flow [2025-01-10 00:39:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-10 00:39:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-01-10 00:39:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 653 transitions. [2025-01-10 00:39:04,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5236567762630313 [2025-01-10 00:39:04,741 INFO L175 Difference]: Start difference. First operand has 420 places, 540 transitions, 10205 flow. Second operand 43 states and 653 transitions. [2025-01-10 00:39:04,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 794 transitions, 18273 flow [2025-01-10 00:39:10,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 794 transitions, 15026 flow, removed 1320 selfloop flow, removed 42 redundant places. [2025-01-10 00:39:10,871 INFO L231 Difference]: Finished difference. Result has 417 places, 558 transitions, 10074 flow [2025-01-10 00:39:10,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=8282, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=10074, PETRI_PLACES=417, PETRI_TRANSITIONS=558} [2025-01-10 00:39:10,871 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 387 predicate places. [2025-01-10 00:39:10,871 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 558 transitions, 10074 flow [2025-01-10 00:39:10,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 10.116279069767442) internal successors, (435), 43 states have internal predecessors, (435), 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:39:10,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:10,872 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:10,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:11,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 00:39:11,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:11,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1583279869, now seen corresponding path program 11 times [2025-01-10 00:39:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:11,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446810801] [2025-01-10 00:39:11,074 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:39:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:11,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 11 equivalence classes. [2025-01-10 00:39:11,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 00:39:11,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-10 00:39:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:39:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446810801] [2025-01-10 00:39:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446810801] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125583589] [2025-01-10 00:39:11,375 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:39:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:11,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:11,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:39:11,414 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 11 equivalence classes. [2025-01-10 00:39:11,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 00:39:11,432 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-10 00:39:11,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:11,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:39:11,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:39:11,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:39:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:39:11,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125583589] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:39:11,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:39:11,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2025-01-10 00:39:11,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814087325] [2025-01-10 00:39:11,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:39:11,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-10 00:39:11,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:11,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-10 00:39:11,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2025-01-10 00:39:11,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:11,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 558 transitions, 10074 flow. Second operand has 44 states, 44 states have (on average 10.113636363636363) internal successors, (445), 44 states have internal predecessors, (445), 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:39:11,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:11,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:11,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:16,203 INFO L124 PetriNetUnfolderBase]: 6025/12186 cut-off events. [2025-01-10 00:39:16,204 INFO L125 PetriNetUnfolderBase]: For 1898236/1898236 co-relation queries the response was YES. [2025-01-10 00:39:16,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112506 conditions, 12186 events. 6025/12186 cut-off events. For 1898236/1898236 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 86491 event pairs, 152 based on Foata normal form. 45/12227 useless extension candidates. Maximal degree in co-relation 112338. Up to 2634 conditions per place. [2025-01-10 00:39:16,432 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 210 selfloop transitions, 492 changer transitions 101/807 dead transitions. [2025-01-10 00:39:16,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 807 transitions, 16954 flow [2025-01-10 00:39:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-10 00:39:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-10 00:39:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 681 transitions. [2025-01-10 00:39:16,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5218390804597701 [2025-01-10 00:39:16,443 INFO L175 Difference]: Start difference. First operand has 417 places, 558 transitions, 10074 flow. Second operand 45 states and 681 transitions. [2025-01-10 00:39:16,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 807 transitions, 16954 flow [2025-01-10 00:39:21,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 807 transitions, 15351 flow, removed 646 selfloop flow, removed 24 redundant places. [2025-01-10 00:39:21,782 INFO L231 Difference]: Finished difference. Result has 440 places, 561 transitions, 10575 flow [2025-01-10 00:39:21,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9251, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=10575, PETRI_PLACES=440, PETRI_TRANSITIONS=561} [2025-01-10 00:39:21,783 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 410 predicate places. [2025-01-10 00:39:21,783 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 561 transitions, 10575 flow [2025-01-10 00:39:21,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 10.113636363636363) internal successors, (445), 44 states have internal predecessors, (445), 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:39:21,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:21,783 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:21,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 00:39:21,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:21,984 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1530479520, now seen corresponding path program 12 times [2025-01-10 00:39:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233351628] [2025-01-10 00:39:21,986 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:39:21,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:21,995 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 10 equivalence classes. [2025-01-10 00:39:22,008 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 00:39:22,009 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-01-10 00:39:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:22,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:39:22,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 00:39:22,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 00:39:22,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:22,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:22,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:39:22,049 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:39:22,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-01-10 00:39:22,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 00:39:22,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-10 00:39:22,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-10 00:39:22,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:39:22,055 INFO L422 BasicCegarLoop]: Path program histogram: [12, 2, 2, 1, 1, 1, 1] [2025-01-10 00:39:22,153 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:39:22,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:39:22,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:39:22 BasicIcfg [2025-01-10 00:39:22,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:39:22,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:39:22,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:39:22,160 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:39:22,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:14" (3/4) ... [2025-01-10 00:39:22,163 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:39:22,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:39:22,165 INFO L158 Benchmark]: Toolchain (without parser) took 68499.23ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 120.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-10 00:39:22,166 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:39:22,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.56ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 101.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:39:22,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.51ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:39:22,167 INFO L158 Benchmark]: Boogie Preprocessor took 44.93ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:39:22,167 INFO L158 Benchmark]: RCFGBuilder took 370.40ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 80.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:39:22,168 INFO L158 Benchmark]: TraceAbstraction took 67585.46ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 80.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-10 00:39:22,168 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 2.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 210.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:39:22,171 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.56ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 101.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.51ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.93ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 370.40ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 80.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67585.46ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 80.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 2.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 210.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=23, id1=-1, id2=0, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L693] 0 __assert_fail ("0", "triangular-longer-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 67.4s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 54.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7670 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7652 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8627 IncrementalHoareTripleChecker+Invalid, 9036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 11 mSDtfsCounter, 8627 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1865 GetRequests, 1004 SyntacticMatches, 0 SemanticMatches, 861 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18045 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10575occurred in iteration=19, InterpolantAutomatonStates: 568, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1349 NumberOfCodeBlocks, 1349 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 1830 ConstructedInterpolants, 0 QuantifiedInterpolants, 8011 SizeOfPredicates, 160 NumberOfNonLiveVariables, 1702 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 43 InterpolantComputations, 7 PerfectInterpolantSequences, 43/3090 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:39:22,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/triangular-longer-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:39:24,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:39:24,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:39:24,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:39:24,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:39:24,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:39:24,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:39:24,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:39:24,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:39:24,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:39:24,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:39:24,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:39:24,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:39:24,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:39:24,754 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:39:24,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:39:24,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:39:24,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:39:24,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:39:24,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:39:24,755 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:39:24,755 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:39:24,758 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:39:24,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:39:24,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:39:24,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:39:24,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:39:24,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:39:24,761 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 -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2025-01-10 00:39:25,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:39:25,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:39:25,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:39:25,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:39:25,074 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:39:25,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-2.i [2025-01-10 00:39:26,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6c14290/4bdc3e8ad5c24e7380a0ac913f590f89/FLAG33d613db8 [2025-01-10 00:39:26,647 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:39:26,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2025-01-10 00:39:26,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6c14290/4bdc3e8ad5c24e7380a0ac913f590f89/FLAG33d613db8 [2025-01-10 00:39:26,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6c14290/4bdc3e8ad5c24e7380a0ac913f590f89 [2025-01-10 00:39:26,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:39:26,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:39:26,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:39:26,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:39:26,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:39:26,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:26" (1/1) ... [2025-01-10 00:39:26,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8635a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26, skipping insertion in model container [2025-01-10 00:39:26,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:26" (1/1) ... [2025-01-10 00:39:26,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:39:27,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:39:27,063 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:39:27,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:39:27,143 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:39:27,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27 WrapperNode [2025-01-10 00:39:27,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:39:27,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:39:27,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:39:27,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:39:27,150 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:39:27" (1/1) ... [2025-01-10 00:39:27,169 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:39:27" (1/1) ... [2025-01-10 00:39:27,187 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-01-10 00:39:27,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:39:27,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:39:27,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:39:27,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:39:27,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,214 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:39:27,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:39:27,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:39:27,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:39:27,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:39:27,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (1/1) ... [2025-01-10 00:39:27,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:39:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:27,270 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:39:27,274 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:39:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 00:39:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 00:39:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 00:39:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 00:39:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:39:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:39:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:39:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:39:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:39:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:39:27,298 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:39:27,416 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:39:27,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:39:27,551 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:39:27,551 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:39:27,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:39:27,677 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:39:27,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:27 BoogieIcfgContainer [2025-01-10 00:39:27,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:39:27,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:39:27,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:39:27,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:39:27,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:39:26" (1/3) ... [2025-01-10 00:39:27,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368b8873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:27, skipping insertion in model container [2025-01-10 00:39:27,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:27" (2/3) ... [2025-01-10 00:39:27,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368b8873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:27, skipping insertion in model container [2025-01-10 00:39:27,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:27" (3/3) ... [2025-01-10 00:39:27,711 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-01-10 00:39:27,724 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:39:27,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 00:39:27,726 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:39:27,771 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:39:27,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-01-10 00:39:27,843 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-10 00:39:27,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:39:27,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-10 00:39:27,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-01-10 00:39:27,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-01-10 00:39:27,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:39:27,870 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;@53cc2a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:39:27,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 00:39:27,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:39:27,887 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-01-10 00:39:27,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:39:27,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:27,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:27,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:27,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:27,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1728578486, now seen corresponding path program 1 times [2025-01-10 00:39:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454657476] [2025-01-10 00:39:27,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:27,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:27,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:27,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:39:27,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:39:28,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:39:28,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:28,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:28,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:39:28,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:28,052 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:39:28,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:28,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454657476] [2025-01-10 00:39:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454657476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:28,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277823381] [2025-01-10 00:39:28,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:28,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:28,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:28,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:28,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-10 00:39:28,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:39:28,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:28,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-10 00:39:28,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:28,170 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2025-01-10 00:39:28,173 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:39:28,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 553 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2025-01-10 00:39:28,177 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-01-10 00:39:28,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2025-01-10 00:39:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 00:39:28,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-01-10 00:39:28,188 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2025-01-10 00:39:28,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2025-01-10 00:39:28,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:28,193 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-01-10 00:39:28,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-01-10 00:39:28,199 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-01-10 00:39:28,199 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-01-10 00:39:28,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:39:28,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:28,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:28,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:28,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:28,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:28,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1728577414, now seen corresponding path program 1 times [2025-01-10 00:39:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323332890] [2025-01-10 00:39:28,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:28,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:28,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:28,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:28,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:39:28,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:39:28,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:39:28,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:28,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:28,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:28,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:28,573 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:39:28,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:28,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323332890] [2025-01-10 00:39:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323332890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:28,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:39:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658274516] [2025-01-10 00:39:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:28,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:39:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:28,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:39:28,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:39:28,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:28,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:39:28,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:28,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:28,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:28,905 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2025-01-10 00:39:28,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:39:28,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 593 events. 328/593 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2602 event pairs, 45 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 1120. Up to 243 conditions per place. [2025-01-10 00:39:28,914 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2025-01-10 00:39:28,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2025-01-10 00:39:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:39:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:39:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2025-01-10 00:39:28,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2025-01-10 00:39:28,917 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2025-01-10 00:39:28,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2025-01-10 00:39:28,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:39:28,920 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2025-01-10 00:39:28,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2025-01-10 00:39:28,921 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2025-01-10 00:39:28,921 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2025-01-10 00:39:28,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:39:28,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:28,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:28,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:29,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:29,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:29,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1895906289, now seen corresponding path program 1 times [2025-01-10 00:39:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:29,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367017592] [2025-01-10 00:39:29,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:29,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:29,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:39:29,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:39:29,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:39:29,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:29,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:29,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:29,268 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:39:29,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:29,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367017592] [2025-01-10 00:39:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367017592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:29,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:39:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411954408] [2025-01-10 00:39:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:29,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:29,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:29,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:29,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:29,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:39:29,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:29,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:29,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:29,504 INFO L124 PetriNetUnfolderBase]: 247/454 cut-off events. [2025-01-10 00:39:29,504 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2025-01-10 00:39:29,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 454 events. 247/454 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1813 event pairs, 50 based on Foata normal form. 18/468 useless extension candidates. Maximal degree in co-relation 1170. Up to 190 conditions per place. [2025-01-10 00:39:29,509 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2025-01-10 00:39:29,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2025-01-10 00:39:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:39:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:39:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-01-10 00:39:29,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2025-01-10 00:39:29,513 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2025-01-10 00:39:29,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2025-01-10 00:39:29,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:29,519 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2025-01-10 00:39:29,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2025-01-10 00:39:29,520 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-01-10 00:39:29,520 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2025-01-10 00:39:29,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:39:29,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:29,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:29,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:29,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:29,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:29,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1099141914, now seen corresponding path program 1 times [2025-01-10 00:39:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:29,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467605201] [2025-01-10 00:39:29,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:29,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:29,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:29,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:39:29,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:39:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:39:29,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:29,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:29,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:29,857 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:39:29,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:29,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467605201] [2025-01-10 00:39:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467605201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:39:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042264627] [2025-01-10 00:39:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:29,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:29,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:29,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:29,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:29,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:39:29,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:29,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:29,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:30,141 INFO L124 PetriNetUnfolderBase]: 391/725 cut-off events. [2025-01-10 00:39:30,141 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2025-01-10 00:39:30,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 725 events. 391/725 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3194 event pairs, 95 based on Foata normal form. 27/748 useless extension candidates. Maximal degree in co-relation 2098. Up to 264 conditions per place. [2025-01-10 00:39:30,147 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2025-01-10 00:39:30,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2025-01-10 00:39:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:39:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:39:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-01-10 00:39:30,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-01-10 00:39:30,149 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2025-01-10 00:39:30,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2025-01-10 00:39:30,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-01-10 00:39:30,157 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2025-01-10 00:39:30,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2025-01-10 00:39:30,158 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2025-01-10 00:39:30,158 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2025-01-10 00:39:30,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:39:30,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:30,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:30,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:39:30,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:30,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:30,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1216153626, now seen corresponding path program 2 times [2025-01-10 00:39:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:30,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789699822] [2025-01-10 00:39:30,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:30,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:30,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:30,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:39:30,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:39:30,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:39:30,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:39:30,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:30,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:30,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:30,498 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:39:30,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:30,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:30,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789699822] [2025-01-10 00:39:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789699822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:30,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:30,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:39:30,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251385102] [2025-01-10 00:39:30,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:30,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:30,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:30,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:30,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:30,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:30,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:39:30,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:30,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:30,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:30,780 INFO L124 PetriNetUnfolderBase]: 346/655 cut-off events. [2025-01-10 00:39:30,780 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2025-01-10 00:39:30,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 655 events. 346/655 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2872 event pairs, 88 based on Foata normal form. 45/696 useless extension candidates. Maximal degree in co-relation 2166. Up to 273 conditions per place. [2025-01-10 00:39:30,785 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2025-01-10 00:39:30,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2025-01-10 00:39:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:39:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:39:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-01-10 00:39:30,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-01-10 00:39:30,787 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2025-01-10 00:39:30,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2025-01-10 00:39:30,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:30,796 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2025-01-10 00:39:30,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-01-10 00:39:30,799 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2025-01-10 00:39:30,799 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2025-01-10 00:39:30,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:39:30,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:30,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:30,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:39:31,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:31,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:31,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2139154681, now seen corresponding path program 1 times [2025-01-10 00:39:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1602614073] [2025-01-10 00:39:31,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:31,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:31,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:31,005 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:31,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:39:31,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:39:31,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:39:31,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:31,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:31,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:39:31,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:31,147 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:39:31,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:31,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602614073] [2025-01-10 00:39:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602614073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:31,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:31,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:39:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998582001] [2025-01-10 00:39:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:31,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:39:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:31,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:39:31,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:39:31,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:31,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:39:31,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:31,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:31,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:31,437 INFO L124 PetriNetUnfolderBase]: 427/806 cut-off events. [2025-01-10 00:39:31,437 INFO L125 PetriNetUnfolderBase]: For 3492/3492 co-relation queries the response was YES. [2025-01-10 00:39:31,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 806 events. 427/806 cut-off events. For 3492/3492 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3713 event pairs, 122 based on Foata normal form. 27/829 useless extension candidates. Maximal degree in co-relation 2874. Up to 316 conditions per place. [2025-01-10 00:39:31,444 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 51 selfloop transitions, 12 changer transitions 26/93 dead transitions. [2025-01-10 00:39:31,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 752 flow [2025-01-10 00:39:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:39:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:39:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2025-01-10 00:39:31,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2025-01-10 00:39:31,446 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 10 states and 158 transitions. [2025-01-10 00:39:31,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 752 flow [2025-01-10 00:39:31,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 718 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-01-10 00:39:31,455 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 345 flow [2025-01-10 00:39:31,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=345, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2025-01-10 00:39:31,457 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-01-10 00:39:31,457 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 345 flow [2025-01-10 00:39:31,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:39:31,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:31,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:31,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:39:31,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:31,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:39:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -88611951, now seen corresponding path program 2 times [2025-01-10 00:39:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160399347] [2025-01-10 00:39:31,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:31,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:31,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:31,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:31,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:39:31,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:39:31,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:39:31,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:39:31,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:31,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:39:31,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:31,790 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:39:31,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:31,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160399347] [2025-01-10 00:39:31,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160399347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:31,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:39:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740601566] [2025-01-10 00:39:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:39:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:31,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:39:31,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:39:31,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 00:39:31,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:39:31,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:31,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 00:39:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:32,122 INFO L124 PetriNetUnfolderBase]: 463/891 cut-off events. [2025-01-10 00:39:32,122 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2025-01-10 00:39:32,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 891 events. 463/891 cut-off events. For 6473/6473 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4351 event pairs, 120 based on Foata normal form. 27/914 useless extension candidates. Maximal degree in co-relation 3577. Up to 340 conditions per place. [2025-01-10 00:39:32,130 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 17 changer transitions 30/107 dead transitions. [2025-01-10 00:39:32,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 978 flow [2025-01-10 00:39:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:39:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:39:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2025-01-10 00:39:32,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-01-10 00:39:32,132 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 345 flow. Second operand 12 states and 186 transitions. [2025-01-10 00:39:32,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 978 flow [2025-01-10 00:39:32,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 842 flow, removed 59 selfloop flow, removed 7 redundant places. [2025-01-10 00:39:32,142 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 395 flow [2025-01-10 00:39:32,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2025-01-10 00:39:32,143 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2025-01-10 00:39:32,143 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 395 flow [2025-01-10 00:39:32,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:39:32,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:32,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:32,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0