./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:26:59,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:26:59,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:26:59,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:26:59,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:26:59,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:26:59,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:26:59,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:26:59,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:26:59,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:26:59,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:26:59,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:26:59,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:26:59,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:26:59,848 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:26:59,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:26:59,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:26:59,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:26:59,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:26:59,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:26:59,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:26:59,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:26:59,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:26:59,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:26:59,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:26:59,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:26:59,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:26:59,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:26:59,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:26:59,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:26:59,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:26:59,851 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2025-02-08 08:27:00,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:27:00,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:27:00,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:27:00,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:27:00,090 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:27:00,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:27:01,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a08b8d982/391b0a8bcc5644a2ab2971dc888eff3f/FLAGa1e13a8e1 [2025-02-08 08:27:01,442 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:27:01,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:27:01,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a08b8d982/391b0a8bcc5644a2ab2971dc888eff3f/FLAGa1e13a8e1 [2025-02-08 08:27:01,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a08b8d982/391b0a8bcc5644a2ab2971dc888eff3f [2025-02-08 08:27:01,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:27:01,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:27:01,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:01,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:27:01,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:27:01,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:01" (1/1) ... [2025-02-08 08:27:01,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c44e211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:01, skipping insertion in model container [2025-02-08 08:27:01,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:01" (1/1) ... [2025-02-08 08:27:01,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:27:02,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:02,083 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:27:02,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:02,163 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:27:02,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02 WrapperNode [2025-02-08 08:27:02,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:02,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:02,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:27:02,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:27:02,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,201 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2025-02-08 08:27:02,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:02,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:27:02,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:27:02,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:27:02,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,236 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-02-08 08:27:02,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:27:02,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:27:02,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:27:02,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:27:02,263 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (1/1) ... [2025-02-08 08:27:02,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:02,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:02,291 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-02-08 08:27:02,297 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-02-08 08:27:02,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:27:02,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:27:02,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:27:02,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:27:02,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:27:02,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:27:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:27:02,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:27:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:27:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:27:02,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:27:02,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:27:02,315 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:27:02,416 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:27:02,417 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:27:02,730 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:27:02,730 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:27:02,937 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:27:02,937 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:27:02,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:02 BoogieIcfgContainer [2025-02-08 08:27:02,938 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:27:02,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:27:02,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:27:02,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:27:02,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:27:01" (1/3) ... [2025-02-08 08:27:02,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24704185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:02, skipping insertion in model container [2025-02-08 08:27:02,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:02" (2/3) ... [2025-02-08 08:27:02,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24704185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:02, skipping insertion in model container [2025-02-08 08:27:02,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:02" (3/3) ... [2025-02-08 08:27:02,947 INFO L128 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:27:02,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:27:02,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 45 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:27:02,961 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:27:03,008 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:03,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:27:03,061 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2025-02-08 08:27:03,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:03,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-08 08:27:03,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:27:03,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2025-02-08 08:27:03,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:03,089 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;@127a4116, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:03,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:27:03,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:03,096 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-02-08 08:27:03,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:03,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:03,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:03,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:03,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1526274788, now seen corresponding path program 1 times [2025-02-08 08:27:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130025477] [2025-02-08 08:27:03,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:03,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:27:03,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:27:03,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:03,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130025477] [2025-02-08 08:27:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130025477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:03,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:03,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:03,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225949521] [2025-02-08 08:27:03,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:03,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:03,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:03,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:03,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:03,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:03,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-08 08:27:03,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:03,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:03,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:04,730 INFO L124 PetriNetUnfolderBase]: 7377/10637 cut-off events. [2025-02-08 08:27:04,731 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 08:27:04,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21186 conditions, 10637 events. 7377/10637 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 59385 event pairs, 972 based on Foata normal form. 588/11220 useless extension candidates. Maximal degree in co-relation 21175. Up to 8856 conditions per place. [2025-02-08 08:27:04,778 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-08 08:27:04,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-02-08 08:27:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-08 08:27:04,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2025-02-08 08:27:04,789 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 88 transitions. [2025-02-08 08:27:04,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-02-08 08:27:04,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:27:04,795 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2025-02-08 08:27:04,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-02-08 08:27:04,800 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-02-08 08:27:04,801 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2025-02-08 08:27:04,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-08 08:27:04,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:04,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:04,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:27:04,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1212809020, now seen corresponding path program 1 times [2025-02-08 08:27:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568415843] [2025-02-08 08:27:04,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:04,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:04,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:04,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:04,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:04,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568415843] [2025-02-08 08:27:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568415843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:04,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076347130] [2025-02-08 08:27:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:04,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:04,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:04,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:04,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:04,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:04,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:04,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:04,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:05,697 INFO L124 PetriNetUnfolderBase]: 6628/10280 cut-off events. [2025-02-08 08:27:05,698 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2025-02-08 08:27:05,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20226 conditions, 10280 events. 6628/10280 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 62800 event pairs, 6628 based on Foata normal form. 294/10569 useless extension candidates. Maximal degree in co-relation 20216. Up to 9387 conditions per place. [2025-02-08 08:27:05,748 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-02-08 08:27:05,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2025-02-08 08:27:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-08 08:27:05,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2025-02-08 08:27:05,751 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2025-02-08 08:27:05,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2025-02-08 08:27:05,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:27:05,755 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2025-02-08 08:27:05,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-08 08:27:05,756 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-02-08 08:27:05,756 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2025-02-08 08:27:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:05,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:05,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:05,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:27:05,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:05,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1212808090, now seen corresponding path program 1 times [2025-02-08 08:27:05,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:05,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460133313] [2025-02-08 08:27:05,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:05,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:05,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:05,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:05,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460133313] [2025-02-08 08:27:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460133313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:27:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489784907] [2025-02-08 08:27:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:06,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:06,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:06,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:06,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:06,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:06,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:06,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:07,843 INFO L124 PetriNetUnfolderBase]: 9820/14515 cut-off events. [2025-02-08 08:27:07,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:07,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28584 conditions, 14515 events. 9820/14515 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 88566 event pairs, 1804 based on Foata normal form. 0/14192 useless extension candidates. Maximal degree in co-relation 28578. Up to 8269 conditions per place. [2025-02-08 08:27:07,890 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 55 selfloop transitions, 11 changer transitions 117/188 dead transitions. [2025-02-08 08:27:07,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 188 transitions, 754 flow [2025-02-08 08:27:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:27:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:27:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 294 transitions. [2025-02-08 08:27:07,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2025-02-08 08:27:07,893 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 12 states and 294 transitions. [2025-02-08 08:27:07,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 188 transitions, 754 flow [2025-02-08 08:27:07,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 188 transitions, 753 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:27:07,898 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 189 flow [2025-02-08 08:27:07,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=189, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2025-02-08 08:27:07,899 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-02-08 08:27:07,899 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 189 flow [2025-02-08 08:27:07,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:07,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:07,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:07,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:27:07,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:07,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1158576913, now seen corresponding path program 1 times [2025-02-08 08:27:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:07,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386888179] [2025-02-08 08:27:07,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:07,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:27:07,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:27:07,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386888179] [2025-02-08 08:27:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386888179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:08,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:08,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:27:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286139166] [2025-02-08 08:27:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:08,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:27:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:08,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:27:08,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:27:08,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:08,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:08,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:08,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:08,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:09,120 INFO L124 PetriNetUnfolderBase]: 6992/10387 cut-off events. [2025-02-08 08:27:09,121 INFO L125 PetriNetUnfolderBase]: For 16129/16129 co-relation queries the response was YES. [2025-02-08 08:27:09,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33015 conditions, 10387 events. 6992/10387 cut-off events. For 16129/16129 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 59154 event pairs, 1973 based on Foata normal form. 322/10704 useless extension candidates. Maximal degree in co-relation 32999. Up to 5483 conditions per place. [2025-02-08 08:27:09,169 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 59 selfloop transitions, 3 changer transitions 73/140 dead transitions. [2025-02-08 08:27:09,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 140 transitions, 885 flow [2025-02-08 08:27:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:27:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:27:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-02-08 08:27:09,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.531055900621118 [2025-02-08 08:27:09,172 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 189 flow. Second operand 7 states and 171 transitions. [2025-02-08 08:27:09,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 140 transitions, 885 flow [2025-02-08 08:27:09,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 140 transitions, 827 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-02-08 08:27:09,252 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 190 flow [2025-02-08 08:27:09,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2025-02-08 08:27:09,253 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2025-02-08 08:27:09,253 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 190 flow [2025-02-08 08:27:09,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:09,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:09,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:09,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:27:09,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:09,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash -454386161, now seen corresponding path program 1 times [2025-02-08 08:27:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065667299] [2025-02-08 08:27:09,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:09,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:27:09,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:27:09,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:09,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:09,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:09,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065667299] [2025-02-08 08:27:09,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065667299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:09,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:09,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:27:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116449085] [2025-02-08 08:27:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:09,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:09,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:09,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:09,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:09,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:09,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:09,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:09,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:09,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:10,731 INFO L124 PetriNetUnfolderBase]: 6269/9217 cut-off events. [2025-02-08 08:27:10,732 INFO L125 PetriNetUnfolderBase]: For 12061/12061 co-relation queries the response was YES. [2025-02-08 08:27:10,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28096 conditions, 9217 events. 6269/9217 cut-off events. For 12061/12061 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 50159 event pairs, 712 based on Foata normal form. 166/9380 useless extension candidates. Maximal degree in co-relation 28078. Up to 6850 conditions per place. [2025-02-08 08:27:10,774 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 67 selfloop transitions, 8 changer transitions 51/131 dead transitions. [2025-02-08 08:27:10,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 131 transitions, 789 flow [2025-02-08 08:27:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:27:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:27:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-02-08 08:27:10,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5027173913043478 [2025-02-08 08:27:10,776 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 190 flow. Second operand 8 states and 185 transitions. [2025-02-08 08:27:10,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 131 transitions, 789 flow [2025-02-08 08:27:10,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 757 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-02-08 08:27:10,820 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 258 flow [2025-02-08 08:27:10,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=258, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2025-02-08 08:27:10,820 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-02-08 08:27:10,820 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 258 flow [2025-02-08 08:27:10,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:10,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:10,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:10,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:27:10,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:10,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -47585245, now seen corresponding path program 2 times [2025-02-08 08:27:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:10,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136975839] [2025-02-08 08:27:10,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:27:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:10,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:27:10,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:27:10,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:10,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:11,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:11,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136975839] [2025-02-08 08:27:11,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136975839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:11,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:11,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:27:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617019063] [2025-02-08 08:27:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:11,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:27:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:11,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:27:11,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:27:11,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:11,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 258 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-02-08 08:27:11,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:11,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:11,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:13,385 INFO L124 PetriNetUnfolderBase]: 11631/17098 cut-off events. [2025-02-08 08:27:13,386 INFO L125 PetriNetUnfolderBase]: For 25450/25452 co-relation queries the response was YES. [2025-02-08 08:27:13,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54906 conditions, 17098 events. 11631/17098 cut-off events. For 25450/25452 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 102874 event pairs, 1944 based on Foata normal form. 482/17577 useless extension candidates. Maximal degree in co-relation 54886. Up to 6410 conditions per place. [2025-02-08 08:27:13,455 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 90 selfloop transitions, 17 changer transitions 103/215 dead transitions. [2025-02-08 08:27:13,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 215 transitions, 1433 flow [2025-02-08 08:27:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:27:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:27:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-02-08 08:27:13,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525691699604743 [2025-02-08 08:27:13,457 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 258 flow. Second operand 11 states and 266 transitions. [2025-02-08 08:27:13,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 215 transitions, 1433 flow [2025-02-08 08:27:13,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 215 transitions, 1373 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-02-08 08:27:13,626 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 419 flow [2025-02-08 08:27:13,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=419, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2025-02-08 08:27:13,626 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2025-02-08 08:27:13,626 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 419 flow [2025-02-08 08:27:13,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-02-08 08:27:13,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:13,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:13,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:27:13,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:13,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2144934554, now seen corresponding path program 1 times [2025-02-08 08:27:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:13,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484200526] [2025-02-08 08:27:13,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:13,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:27:13,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:27:13,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484200526] [2025-02-08 08:27:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484200526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:14,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:27:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039473114] [2025-02-08 08:27:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:27:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:14,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:27:14,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:27:14,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:14,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-02-08 08:27:14,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:14,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:15,790 INFO L124 PetriNetUnfolderBase]: 12400/18196 cut-off events. [2025-02-08 08:27:15,791 INFO L125 PetriNetUnfolderBase]: For 35906/35906 co-relation queries the response was YES. [2025-02-08 08:27:15,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61434 conditions, 18196 events. 12400/18196 cut-off events. For 35906/35906 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 108447 event pairs, 935 based on Foata normal form. 112/18304 useless extension candidates. Maximal degree in co-relation 61408. Up to 10329 conditions per place. [2025-02-08 08:27:15,916 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 149 selfloop transitions, 32 changer transitions 88/274 dead transitions. [2025-02-08 08:27:15,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 274 transitions, 2108 flow [2025-02-08 08:27:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:27:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 08:27:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 359 transitions. [2025-02-08 08:27:15,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45907928388746805 [2025-02-08 08:27:15,918 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 419 flow. Second operand 17 states and 359 transitions. [2025-02-08 08:27:15,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 274 transitions, 2108 flow [2025-02-08 08:27:16,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 274 transitions, 2059 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-02-08 08:27:16,108 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 803 flow [2025-02-08 08:27:16,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=803, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2025-02-08 08:27:16,109 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2025-02-08 08:27:16,109 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 803 flow [2025-02-08 08:27:16,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-02-08 08:27:16,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:16,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:16,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:27:16,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:16,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1967018655, now seen corresponding path program 1 times [2025-02-08 08:27:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474358671] [2025-02-08 08:27:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:16,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:27:16,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:27:16,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:16,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474358671] [2025-02-08 08:27:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474358671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:27:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366552328] [2025-02-08 08:27:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:16,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:27:16,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:16,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:27:16,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:27:16,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:16,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 803 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02-08 08:27:16,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:16,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:16,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:18,141 INFO L124 PetriNetUnfolderBase]: 13618/20076 cut-off events. [2025-02-08 08:27:18,141 INFO L125 PetriNetUnfolderBase]: For 83251/83251 co-relation queries the response was YES. [2025-02-08 08:27:18,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79758 conditions, 20076 events. 13618/20076 cut-off events. For 83251/83251 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 122843 event pairs, 5882 based on Foata normal form. 172/20244 useless extension candidates. Maximal degree in co-relation 79723. Up to 10001 conditions per place. [2025-02-08 08:27:18,230 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 89 selfloop transitions, 4 changer transitions 66/164 dead transitions. [2025-02-08 08:27:18,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 164 transitions, 1701 flow [2025-02-08 08:27:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:27:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:27:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-02-08 08:27:18,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5062111801242236 [2025-02-08 08:27:18,232 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 803 flow. Second operand 7 states and 163 transitions. [2025-02-08 08:27:18,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 164 transitions, 1701 flow [2025-02-08 08:27:18,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 164 transitions, 1611 flow, removed 43 selfloop flow, removed 7 redundant places. [2025-02-08 08:27:18,464 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 620 flow [2025-02-08 08:27:18,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=620, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-02-08 08:27:18,465 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2025-02-08 08:27:18,465 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 620 flow [2025-02-08 08:27:18,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02-08 08:27:18,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:18,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:18,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:27:18,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:18,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1766287268, now seen corresponding path program 1 times [2025-02-08 08:27:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:18,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740461079] [2025-02-08 08:27:18,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:18,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:27:18,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:27:18,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:18,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740461079] [2025-02-08 08:27:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740461079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:27:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40391245] [2025-02-08 08:27:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:27:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:18,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:27:18,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:27:19,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:19,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 620 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-02-08 08:27:19,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:19,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:19,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:20,526 INFO L124 PetriNetUnfolderBase]: 11880/17774 cut-off events. [2025-02-08 08:27:20,527 INFO L125 PetriNetUnfolderBase]: For 72740/72740 co-relation queries the response was YES. [2025-02-08 08:27:20,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68699 conditions, 17774 events. 11880/17774 cut-off events. For 72740/72740 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 108919 event pairs, 3744 based on Foata normal form. 72/17843 useless extension candidates. Maximal degree in co-relation 68665. Up to 16251 conditions per place. [2025-02-08 08:27:20,611 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 81 selfloop transitions, 12 changer transitions 40/138 dead transitions. [2025-02-08 08:27:20,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 138 transitions, 1184 flow [2025-02-08 08:27:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:27:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:27:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-02-08 08:27:20,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4592391304347826 [2025-02-08 08:27:20,612 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 620 flow. Second operand 8 states and 169 transitions. [2025-02-08 08:27:20,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 138 transitions, 1184 flow [2025-02-08 08:27:20,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 138 transitions, 1162 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 08:27:20,784 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 706 flow [2025-02-08 08:27:20,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2025-02-08 08:27:20,785 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2025-02-08 08:27:20,785 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 706 flow [2025-02-08 08:27:20,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-02-08 08:27:20,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:20,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:27:20,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1359510596, now seen corresponding path program 1 times [2025-02-08 08:27:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110548531] [2025-02-08 08:27:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:20,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:27:20,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:27:20,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:20,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:21,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110548531] [2025-02-08 08:27:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110548531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:21,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:21,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:27:21,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620870994] [2025-02-08 08:27:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:21,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:27:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:21,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:27:21,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:27:21,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:21,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 706 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:21,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:21,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:21,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:23,344 INFO L124 PetriNetUnfolderBase]: 15582/23195 cut-off events. [2025-02-08 08:27:23,344 INFO L125 PetriNetUnfolderBase]: For 103527/103527 co-relation queries the response was YES. [2025-02-08 08:27:23,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92010 conditions, 23195 events. 15582/23195 cut-off events. For 103527/103527 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 148179 event pairs, 4733 based on Foata normal form. 156/23348 useless extension candidates. Maximal degree in co-relation 91973. Up to 14844 conditions per place. [2025-02-08 08:27:23,440 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 133 selfloop transitions, 58 changer transitions 61/257 dead transitions. [2025-02-08 08:27:23,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 257 transitions, 2666 flow [2025-02-08 08:27:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:27:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:27:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 252 transitions. [2025-02-08 08:27:23,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4980237154150198 [2025-02-08 08:27:23,441 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 706 flow. Second operand 11 states and 252 transitions. [2025-02-08 08:27:23,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 257 transitions, 2666 flow [2025-02-08 08:27:23,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 257 transitions, 2626 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-02-08 08:27:23,668 INFO L231 Difference]: Finished difference. Result has 100 places, 125 transitions, 1578 flow [2025-02-08 08:27:23,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1578, PETRI_PLACES=100, PETRI_TRANSITIONS=125} [2025-02-08 08:27:23,669 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2025-02-08 08:27:23,669 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 125 transitions, 1578 flow [2025-02-08 08:27:23,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:23,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:23,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:23,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:27:23,669 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash -782292920, now seen corresponding path program 2 times [2025-02-08 08:27:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344488757] [2025-02-08 08:27:23,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:27:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:23,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:27:23,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:27:23,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:23,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:24,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344488757] [2025-02-08 08:27:24,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344488757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:24,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:24,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:27:24,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098607485] [2025-02-08 08:27:24,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:24,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:27:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:24,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:27:24,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:27:24,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:24,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 125 transitions, 1578 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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-02-08 08:27:24,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:24,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:24,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:28,684 INFO L124 PetriNetUnfolderBase]: 17393/26027 cut-off events. [2025-02-08 08:27:28,684 INFO L125 PetriNetUnfolderBase]: For 166808/166808 co-relation queries the response was YES. [2025-02-08 08:27:28,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113097 conditions, 26027 events. 17393/26027 cut-off events. For 166808/166808 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 169905 event pairs, 3299 based on Foata normal form. 216/26240 useless extension candidates. Maximal degree in co-relation 113055. Up to 12541 conditions per place. [2025-02-08 08:27:28,874 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 187 selfloop transitions, 50 changer transitions 101/343 dead transitions. [2025-02-08 08:27:28,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 343 transitions, 3904 flow [2025-02-08 08:27:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:27:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 08:27:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 363 transitions. [2025-02-08 08:27:28,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4641943734015345 [2025-02-08 08:27:28,876 INFO L175 Difference]: Start difference. First operand has 100 places, 125 transitions, 1578 flow. Second operand 17 states and 363 transitions. [2025-02-08 08:27:28,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 343 transitions, 3904 flow [2025-02-08 08:27:29,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 343 transitions, 3669 flow, removed 117 selfloop flow, removed 3 redundant places. [2025-02-08 08:27:29,320 INFO L231 Difference]: Finished difference. Result has 123 places, 152 transitions, 2056 flow [2025-02-08 08:27:29,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2056, PETRI_PLACES=123, PETRI_TRANSITIONS=152} [2025-02-08 08:27:29,320 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2025-02-08 08:27:29,320 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 152 transitions, 2056 flow [2025-02-08 08:27:29,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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-02-08 08:27:29,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:29,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:29,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:27:29,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:29,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1820360980, now seen corresponding path program 3 times [2025-02-08 08:27:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647723751] [2025-02-08 08:27:29,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:27:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:29,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:27:29,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:27:29,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:27:29,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647723751] [2025-02-08 08:27:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647723751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:27:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845082647] [2025-02-08 08:27:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:29,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:27:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:29,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:27:29,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:27:29,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:29,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 152 transitions, 2056 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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-02-08 08:27:29,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:29,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:29,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:32,489 INFO L124 PetriNetUnfolderBase]: 16439/24855 cut-off events. [2025-02-08 08:27:32,489 INFO L125 PetriNetUnfolderBase]: For 172487/172487 co-relation queries the response was YES. [2025-02-08 08:27:32,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113279 conditions, 24855 events. 16439/24855 cut-off events. For 172487/172487 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 164067 event pairs, 3262 based on Foata normal form. 156/25008 useless extension candidates. Maximal degree in co-relation 113226. Up to 17624 conditions per place. [2025-02-08 08:27:32,774 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 196 selfloop transitions, 95 changer transitions 56/352 dead transitions. [2025-02-08 08:27:32,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 352 transitions, 4386 flow [2025-02-08 08:27:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:27:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 08:27:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 350 transitions. [2025-02-08 08:27:32,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4475703324808184 [2025-02-08 08:27:32,776 INFO L175 Difference]: Start difference. First operand has 123 places, 152 transitions, 2056 flow. Second operand 17 states and 350 transitions. [2025-02-08 08:27:32,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 352 transitions, 4386 flow [2025-02-08 08:27:33,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 352 transitions, 4268 flow, removed 34 selfloop flow, removed 9 redundant places. [2025-02-08 08:27:33,247 INFO L231 Difference]: Finished difference. Result has 130 places, 190 transitions, 2939 flow [2025-02-08 08:27:33,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2939, PETRI_PLACES=130, PETRI_TRANSITIONS=190} [2025-02-08 08:27:33,247 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 79 predicate places. [2025-02-08 08:27:33,248 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 190 transitions, 2939 flow [2025-02-08 08:27:33,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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-02-08 08:27:33,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:33,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:33,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:27:33,248 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:33,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash 368786492, now seen corresponding path program 4 times [2025-02-08 08:27:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559174801] [2025-02-08 08:27:33,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:27:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:33,256 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 08:27:33,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:27:33,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:27:33,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:33,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559174801] [2025-02-08 08:27:33,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559174801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:33,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:33,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:27:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143722060] [2025-02-08 08:27:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:33,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:27:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:33,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:27:33,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:27:33,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:33,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 190 transitions, 2939 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-08 08:27:33,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:33,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:33,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:35,271 INFO L124 PetriNetUnfolderBase]: 13598/21017 cut-off events. [2025-02-08 08:27:35,271 INFO L125 PetriNetUnfolderBase]: For 193830/193830 co-relation queries the response was YES. [2025-02-08 08:27:35,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96056 conditions, 21017 events. 13598/21017 cut-off events. For 193830/193830 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 143068 event pairs, 2141 based on Foata normal form. 1215/22229 useless extension candidates. Maximal degree in co-relation 96003. Up to 10377 conditions per place. [2025-02-08 08:27:35,487 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 181 selfloop transitions, 5 changer transitions 33/224 dead transitions. [2025-02-08 08:27:35,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 224 transitions, 3738 flow [2025-02-08 08:27:35,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:27:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:27:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-02-08 08:27:35,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5815217391304348 [2025-02-08 08:27:35,488 INFO L175 Difference]: Start difference. First operand has 130 places, 190 transitions, 2939 flow. Second operand 4 states and 107 transitions. [2025-02-08 08:27:35,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 224 transitions, 3738 flow [2025-02-08 08:27:35,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 224 transitions, 3547 flow, removed 70 selfloop flow, removed 12 redundant places. [2025-02-08 08:27:35,762 INFO L231 Difference]: Finished difference. Result has 118 places, 121 transitions, 1645 flow [2025-02-08 08:27:35,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1645, PETRI_PLACES=118, PETRI_TRANSITIONS=121} [2025-02-08 08:27:35,763 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2025-02-08 08:27:35,763 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 121 transitions, 1645 flow [2025-02-08 08:27:35,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-08 08:27:35,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:35,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:27:35,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:35,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:35,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1378127354, now seen corresponding path program 1 times [2025-02-08 08:27:35,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:35,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668089748] [2025-02-08 08:27:35,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:35,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:35,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:27:35,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:27:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:35,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668089748] [2025-02-08 08:27:35,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668089748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:35,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:35,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:27:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934193752] [2025-02-08 08:27:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:35,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:27:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:35,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:27:35,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:27:35,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:35,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 121 transitions, 1645 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:35,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:35,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:35,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:37,068 INFO L124 PetriNetUnfolderBase]: 8493/13291 cut-off events. [2025-02-08 08:27:37,068 INFO L125 PetriNetUnfolderBase]: For 107189/107189 co-relation queries the response was YES. [2025-02-08 08:27:37,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61059 conditions, 13291 events. 8493/13291 cut-off events. For 107189/107189 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 84571 event pairs, 1093 based on Foata normal form. 882/14170 useless extension candidates. Maximal degree in co-relation 61009. Up to 4667 conditions per place. [2025-02-08 08:27:37,159 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 150 selfloop transitions, 8 changer transitions 31/194 dead transitions. [2025-02-08 08:27:37,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 3003 flow [2025-02-08 08:27:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:27:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:27:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-08 08:27:37,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5695652173913044 [2025-02-08 08:27:37,160 INFO L175 Difference]: Start difference. First operand has 118 places, 121 transitions, 1645 flow. Second operand 5 states and 131 transitions. [2025-02-08 08:27:37,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 3003 flow [2025-02-08 08:27:37,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 194 transitions, 2848 flow, removed 20 selfloop flow, removed 13 redundant places. [2025-02-08 08:27:37,262 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 1260 flow [2025-02-08 08:27:37,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1260, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2025-02-08 08:27:37,263 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 59 predicate places. [2025-02-08 08:27:37,263 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 1260 flow [2025-02-08 08:27:37,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:37,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:37,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:37,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:27:37,263 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:37,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1219922653, now seen corresponding path program 1 times [2025-02-08 08:27:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:37,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669273413] [2025-02-08 08:27:37,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:37,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:27:37,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:27:37,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:37,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:37,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669273413] [2025-02-08 08:27:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669273413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:37,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:27:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774670446] [2025-02-08 08:27:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:37,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:37,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:37,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:37,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:37,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 1260 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-08 08:27:37,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:37,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:37,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:38,151 INFO L124 PetriNetUnfolderBase]: 5402/8410 cut-off events. [2025-02-08 08:27:38,151 INFO L125 PetriNetUnfolderBase]: For 68590/68590 co-relation queries the response was YES. [2025-02-08 08:27:38,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40138 conditions, 8410 events. 5402/8410 cut-off events. For 68590/68590 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 49938 event pairs, 828 based on Foata normal form. 336/8743 useless extension candidates. Maximal degree in co-relation 40093. Up to 3122 conditions per place. [2025-02-08 08:27:38,205 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 113 selfloop transitions, 11 changer transitions 46/175 dead transitions. [2025-02-08 08:27:38,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 175 transitions, 2545 flow [2025-02-08 08:27:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:27:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:27:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-02-08 08:27:38,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2025-02-08 08:27:38,206 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 1260 flow. Second operand 6 states and 133 transitions. [2025-02-08 08:27:38,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 175 transitions, 2545 flow [2025-02-08 08:27:38,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 175 transitions, 2401 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-02-08 08:27:38,341 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 947 flow [2025-02-08 08:27:38,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=947, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2025-02-08 08:27:38,342 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2025-02-08 08:27:38,342 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 947 flow [2025-02-08 08:27:38,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-08 08:27:38,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:38,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:38,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:27:38,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:38,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1209315629, now seen corresponding path program 1 times [2025-02-08 08:27:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:38,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698648449] [2025-02-08 08:27:38,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:38,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:38,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:38,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:38,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:38,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698648449] [2025-02-08 08:27:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698648449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:38,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:38,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:27:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032341898] [2025-02-08 08:27:38,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:38,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:27:38,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:38,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:27:38,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:27:38,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:38,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 947 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-02-08 08:27:38,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:38,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:38,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:39,151 INFO L124 PetriNetUnfolderBase]: 2119/3320 cut-off events. [2025-02-08 08:27:39,151 INFO L125 PetriNetUnfolderBase]: For 22411/22411 co-relation queries the response was YES. [2025-02-08 08:27:39,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15736 conditions, 3320 events. 2119/3320 cut-off events. For 22411/22411 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16452 event pairs, 380 based on Foata normal form. 8/3327 useless extension candidates. Maximal degree in co-relation 15692. Up to 1909 conditions per place. [2025-02-08 08:27:39,173 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 71 selfloop transitions, 26 changer transitions 26/128 dead transitions. [2025-02-08 08:27:39,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 1520 flow [2025-02-08 08:27:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:27:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:27:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-02-08 08:27:39,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39945652173913043 [2025-02-08 08:27:39,174 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 947 flow. Second operand 8 states and 147 transitions. [2025-02-08 08:27:39,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 1520 flow [2025-02-08 08:27:39,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 128 transitions, 1245 flow, removed 85 selfloop flow, removed 19 redundant places. [2025-02-08 08:27:39,212 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 868 flow [2025-02-08 08:27:39,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=868, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2025-02-08 08:27:39,212 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2025-02-08 08:27:39,212 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 868 flow [2025-02-08 08:27:39,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-02-08 08:27:39,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:39,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:39,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:27:39,213 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:39,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash -421845471, now seen corresponding path program 2 times [2025-02-08 08:27:39,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:39,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054390414] [2025-02-08 08:27:39,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:27:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:39,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:39,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:39,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:39,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054390414] [2025-02-08 08:27:39,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054390414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:39,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:39,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:27:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176761706] [2025-02-08 08:27:39,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:39,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:27:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:39,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:27:39,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:27:39,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:39,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 868 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-02-08 08:27:39,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:39,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:39,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:40,126 INFO L124 PetriNetUnfolderBase]: 2432/3831 cut-off events. [2025-02-08 08:27:40,126 INFO L125 PetriNetUnfolderBase]: For 15053/15053 co-relation queries the response was YES. [2025-02-08 08:27:40,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14298 conditions, 3831 events. 2432/3831 cut-off events. For 15053/15053 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19530 event pairs, 442 based on Foata normal form. 8/3838 useless extension candidates. Maximal degree in co-relation 14264. Up to 2056 conditions per place. [2025-02-08 08:27:40,145 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 79 selfloop transitions, 18 changer transitions 35/137 dead transitions. [2025-02-08 08:27:40,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 1401 flow [2025-02-08 08:27:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:27:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:27:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-02-08 08:27:40,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4048913043478261 [2025-02-08 08:27:40,146 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 868 flow. Second operand 8 states and 149 transitions. [2025-02-08 08:27:40,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 1401 flow [2025-02-08 08:27:40,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 1327 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-02-08 08:27:40,160 INFO L231 Difference]: Finished difference. Result has 101 places, 78 transitions, 824 flow [2025-02-08 08:27:40,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=824, PETRI_PLACES=101, PETRI_TRANSITIONS=78} [2025-02-08 08:27:40,161 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2025-02-08 08:27:40,161 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 78 transitions, 824 flow [2025-02-08 08:27:40,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-02-08 08:27:40,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:40,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:40,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:27:40,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:40,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1499250181, now seen corresponding path program 3 times [2025-02-08 08:27:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869376055] [2025-02-08 08:27:40,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:27:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:40,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:40,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:40,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:27:40,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:40,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:40,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869376055] [2025-02-08 08:27:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869376055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:40,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:40,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:27:40,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664304943] [2025-02-08 08:27:40,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:40,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:27:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:40,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:27:40,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:27:40,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:40,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 78 transitions, 824 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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-02-08 08:27:40,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:40,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:40,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:41,412 INFO L124 PetriNetUnfolderBase]: 2901/4587 cut-off events. [2025-02-08 08:27:41,412 INFO L125 PetriNetUnfolderBase]: For 16644/16644 co-relation queries the response was YES. [2025-02-08 08:27:41,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16391 conditions, 4587 events. 2901/4587 cut-off events. For 16644/16644 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 24351 event pairs, 844 based on Foata normal form. 8/4594 useless extension candidates. Maximal degree in co-relation 16357. Up to 2201 conditions per place. [2025-02-08 08:27:41,435 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 119 selfloop transitions, 24 changer transitions 34/182 dead transitions. [2025-02-08 08:27:41,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 182 transitions, 1734 flow [2025-02-08 08:27:41,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:27:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 08:27:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 238 transitions. [2025-02-08 08:27:41,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3979933110367893 [2025-02-08 08:27:41,437 INFO L175 Difference]: Start difference. First operand has 101 places, 78 transitions, 824 flow. Second operand 13 states and 238 transitions. [2025-02-08 08:27:41,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 182 transitions, 1734 flow [2025-02-08 08:27:41,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 182 transitions, 1586 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-02-08 08:27:41,458 INFO L231 Difference]: Finished difference. Result has 103 places, 78 transitions, 784 flow [2025-02-08 08:27:41,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=784, PETRI_PLACES=103, PETRI_TRANSITIONS=78} [2025-02-08 08:27:41,459 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2025-02-08 08:27:41,459 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 78 transitions, 784 flow [2025-02-08 08:27:41,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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-02-08 08:27:41,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:41,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:41,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:27:41,459 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:41,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1752175595, now seen corresponding path program 4 times [2025-02-08 08:27:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721241088] [2025-02-08 08:27:41,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:27:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:41,466 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 08:27:41,495 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:41,495 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:27:41,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:42,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721241088] [2025-02-08 08:27:42,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721241088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:42,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:42,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:27:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165135803] [2025-02-08 08:27:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:42,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:27:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:42,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:27:42,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:27:42,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:42,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 78 transitions, 784 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:42,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:42,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:42,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:42,667 INFO L124 PetriNetUnfolderBase]: 2367/3769 cut-off events. [2025-02-08 08:27:42,667 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2025-02-08 08:27:42,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 3769 events. 2367/3769 cut-off events. For 11440/11440 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19273 event pairs, 660 based on Foata normal form. 16/3784 useless extension candidates. Maximal degree in co-relation 13233. Up to 2840 conditions per place. [2025-02-08 08:27:42,683 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 72 selfloop transitions, 18 changer transitions 14/109 dead transitions. [2025-02-08 08:27:42,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 1088 flow [2025-02-08 08:27:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:27:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:27:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-02-08 08:27:42,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2025-02-08 08:27:42,684 INFO L175 Difference]: Start difference. First operand has 103 places, 78 transitions, 784 flow. Second operand 8 states and 144 transitions. [2025-02-08 08:27:42,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 1088 flow [2025-02-08 08:27:42,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 1013 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-02-08 08:27:42,695 INFO L231 Difference]: Finished difference. Result has 102 places, 77 transitions, 765 flow [2025-02-08 08:27:42,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=765, PETRI_PLACES=102, PETRI_TRANSITIONS=77} [2025-02-08 08:27:42,695 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 51 predicate places. [2025-02-08 08:27:42,695 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 77 transitions, 765 flow [2025-02-08 08:27:42,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:42,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:42,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:42,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:27:42,696 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:42,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -645207621, now seen corresponding path program 5 times [2025-02-08 08:27:42,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:42,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106003896] [2025-02-08 08:27:42,696 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:27:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:42,702 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:42,729 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:42,730 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:42,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106003896] [2025-02-08 08:27:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106003896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:27:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270361124] [2025-02-08 08:27:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:27:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:43,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:27:43,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:27:43,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:43,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 77 transitions, 765 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 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-02-08 08:27:43,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:43,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:43,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:44,392 INFO L124 PetriNetUnfolderBase]: 3316/5244 cut-off events. [2025-02-08 08:27:44,392 INFO L125 PetriNetUnfolderBase]: For 15486/15486 co-relation queries the response was YES. [2025-02-08 08:27:44,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17704 conditions, 5244 events. 3316/5244 cut-off events. For 15486/15486 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29075 event pairs, 718 based on Foata normal form. 16/5259 useless extension candidates. Maximal degree in co-relation 17673. Up to 2638 conditions per place. [2025-02-08 08:27:44,417 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 103 selfloop transitions, 19 changer transitions 59/186 dead transitions. [2025-02-08 08:27:44,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 186 transitions, 1611 flow [2025-02-08 08:27:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:27:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:27:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-02-08 08:27:44,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2025-02-08 08:27:44,418 INFO L175 Difference]: Start difference. First operand has 102 places, 77 transitions, 765 flow. Second operand 11 states and 220 transitions. [2025-02-08 08:27:44,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 186 transitions, 1611 flow [2025-02-08 08:27:44,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 186 transitions, 1548 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-08 08:27:44,431 INFO L231 Difference]: Finished difference. Result has 109 places, 74 transitions, 740 flow [2025-02-08 08:27:44,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=740, PETRI_PLACES=109, PETRI_TRANSITIONS=74} [2025-02-08 08:27:44,431 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 58 predicate places. [2025-02-08 08:27:44,431 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 74 transitions, 740 flow [2025-02-08 08:27:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 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-02-08 08:27:44,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:44,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:44,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:27:44,432 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1801404699, now seen corresponding path program 6 times [2025-02-08 08:27:44,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358309365] [2025-02-08 08:27:44,432 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:27:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:44,439 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:44,450 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:44,450 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:27:44,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358309365] [2025-02-08 08:27:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358309365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:27:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390703305] [2025-02-08 08:27:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:44,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:27:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:44,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:27:44,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:27:44,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:44,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 74 transitions, 740 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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-02-08 08:27:44,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:44,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:44,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:45,274 INFO L124 PetriNetUnfolderBase]: 2124/3372 cut-off events. [2025-02-08 08:27:45,275 INFO L125 PetriNetUnfolderBase]: For 12602/12602 co-relation queries the response was YES. [2025-02-08 08:27:45,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12406 conditions, 3372 events. 2124/3372 cut-off events. For 12602/12602 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16976 event pairs, 650 based on Foata normal form. 8/3379 useless extension candidates. Maximal degree in co-relation 12371. Up to 2371 conditions per place. [2025-02-08 08:27:45,288 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 62 selfloop transitions, 7 changer transitions 46/120 dead transitions. [2025-02-08 08:27:45,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 120 transitions, 1139 flow [2025-02-08 08:27:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:27:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:27:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2025-02-08 08:27:45,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2025-02-08 08:27:45,289 INFO L175 Difference]: Start difference. First operand has 109 places, 74 transitions, 740 flow. Second operand 10 states and 170 transitions. [2025-02-08 08:27:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 120 transitions, 1139 flow [2025-02-08 08:27:45,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 1025 flow, removed 23 selfloop flow, removed 13 redundant places. [2025-02-08 08:27:45,302 INFO L231 Difference]: Finished difference. Result has 104 places, 66 transitions, 566 flow [2025-02-08 08:27:45,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=566, PETRI_PLACES=104, PETRI_TRANSITIONS=66} [2025-02-08 08:27:45,302 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2025-02-08 08:27:45,302 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 66 transitions, 566 flow [2025-02-08 08:27:45,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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-02-08 08:27:45,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:45,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:45,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:27:45,303 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:45,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:45,303 INFO L85 PathProgramCache]: Analyzing trace with hash 908027171, now seen corresponding path program 7 times [2025-02-08 08:27:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996202417] [2025-02-08 08:27:45,303 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:27:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:45,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:45,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:45,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:45,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:45,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996202417] [2025-02-08 08:27:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996202417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:27:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879693157] [2025-02-08 08:27:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:45,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:27:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:45,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:27:45,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:27:45,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:45,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 66 transitions, 566 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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-02-08 08:27:45,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:45,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:45,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:46,278 INFO L124 PetriNetUnfolderBase]: 2538/4052 cut-off events. [2025-02-08 08:27:46,278 INFO L125 PetriNetUnfolderBase]: For 9562/9562 co-relation queries the response was YES. [2025-02-08 08:27:46,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13230 conditions, 4052 events. 2538/4052 cut-off events. For 9562/9562 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21229 event pairs, 852 based on Foata normal form. 8/4060 useless extension candidates. Maximal degree in co-relation 13199. Up to 1849 conditions per place. [2025-02-08 08:27:46,293 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 99 selfloop transitions, 22 changer transitions 39/165 dead transitions. [2025-02-08 08:27:46,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 165 transitions, 1351 flow [2025-02-08 08:27:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:27:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:27:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2025-02-08 08:27:46,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4076086956521739 [2025-02-08 08:27:46,294 INFO L175 Difference]: Start difference. First operand has 104 places, 66 transitions, 566 flow. Second operand 12 states and 225 transitions. [2025-02-08 08:27:46,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 165 transitions, 1351 flow [2025-02-08 08:27:46,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 165 transitions, 1267 flow, removed 24 selfloop flow, removed 12 redundant places. [2025-02-08 08:27:46,305 INFO L231 Difference]: Finished difference. Result has 95 places, 67 transitions, 586 flow [2025-02-08 08:27:46,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=586, PETRI_PLACES=95, PETRI_TRANSITIONS=67} [2025-02-08 08:27:46,305 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2025-02-08 08:27:46,305 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 67 transitions, 586 flow [2025-02-08 08:27:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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-02-08 08:27:46,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:46,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 08:27:46,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1285843537, now seen corresponding path program 8 times [2025-02-08 08:27:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121278416] [2025-02-08 08:27:46,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:27:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:46,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:46,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:46,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:46,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121278416] [2025-02-08 08:27:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121278416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:47,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 08:27:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209471150] [2025-02-08 08:27:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:27:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:47,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:27:47,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:27:47,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:47,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 67 transitions, 586 flow. Second operand has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:47,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:47,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:47,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:48,332 INFO L124 PetriNetUnfolderBase]: 2497/4009 cut-off events. [2025-02-08 08:27:48,332 INFO L125 PetriNetUnfolderBase]: For 8548/8548 co-relation queries the response was YES. [2025-02-08 08:27:48,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12681 conditions, 4009 events. 2497/4009 cut-off events. For 8548/8548 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 21061 event pairs, 686 based on Foata normal form. 16/4025 useless extension candidates. Maximal degree in co-relation 12653. Up to 1405 conditions per place. [2025-02-08 08:27:48,345 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 80 selfloop transitions, 10 changer transitions 46/141 dead transitions. [2025-02-08 08:27:48,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 141 transitions, 1156 flow [2025-02-08 08:27:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:27:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:27:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-02-08 08:27:48,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39723320158102765 [2025-02-08 08:27:48,346 INFO L175 Difference]: Start difference. First operand has 95 places, 67 transitions, 586 flow. Second operand 11 states and 201 transitions. [2025-02-08 08:27:48,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 141 transitions, 1156 flow [2025-02-08 08:27:48,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 141 transitions, 1093 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-02-08 08:27:48,353 INFO L231 Difference]: Finished difference. Result has 99 places, 54 transitions, 409 flow [2025-02-08 08:27:48,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=409, PETRI_PLACES=99, PETRI_TRANSITIONS=54} [2025-02-08 08:27:48,353 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2025-02-08 08:27:48,353 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 54 transitions, 409 flow [2025-02-08 08:27:48,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:48,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:48,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:48,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:27:48,354 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:48,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 332644055, now seen corresponding path program 9 times [2025-02-08 08:27:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:48,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080151672] [2025-02-08 08:27:48,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:27:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:48,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:48,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:48,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:27:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080151672] [2025-02-08 08:27:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080151672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:27:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290121983] [2025-02-08 08:27:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:48,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:27:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:48,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:27:48,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:27:48,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:48,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 54 transitions, 409 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-02-08 08:27:48,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:48,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:48,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:48,838 INFO L124 PetriNetUnfolderBase]: 1075/1739 cut-off events. [2025-02-08 08:27:48,838 INFO L125 PetriNetUnfolderBase]: For 4496/4496 co-relation queries the response was YES. [2025-02-08 08:27:48,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5792 conditions, 1739 events. 1075/1739 cut-off events. For 4496/4496 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7528 event pairs, 785 based on Foata normal form. 8/1747 useless extension candidates. Maximal degree in co-relation 5763. Up to 1201 conditions per place. [2025-02-08 08:27:48,845 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 42 selfloop transitions, 4 changer transitions 35/86 dead transitions. [2025-02-08 08:27:48,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 86 transitions, 681 flow [2025-02-08 08:27:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:27:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:27:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-02-08 08:27:48,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39751552795031053 [2025-02-08 08:27:48,846 INFO L175 Difference]: Start difference. First operand has 99 places, 54 transitions, 409 flow. Second operand 7 states and 128 transitions. [2025-02-08 08:27:48,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 86 transitions, 681 flow [2025-02-08 08:27:48,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 86 transitions, 574 flow, removed 18 selfloop flow, removed 18 redundant places. [2025-02-08 08:27:48,850 INFO L231 Difference]: Finished difference. Result has 86 places, 49 transitions, 274 flow [2025-02-08 08:27:48,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=86, PETRI_TRANSITIONS=49} [2025-02-08 08:27:48,851 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2025-02-08 08:27:48,851 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 49 transitions, 274 flow [2025-02-08 08:27:48,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-02-08 08:27:48,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:48,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 08:27:48,851 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:48,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash 546461827, now seen corresponding path program 10 times [2025-02-08 08:27:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:48,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605136690] [2025-02-08 08:27:48,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:27:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:48,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 08:27:48,912 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:48,912 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:27:48,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:49,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605136690] [2025-02-08 08:27:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605136690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:49,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:49,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:27:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895138224] [2025-02-08 08:27:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:49,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:27:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:49,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:27:49,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:27:49,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:49,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 49 transitions, 274 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 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-02-08 08:27:49,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:49,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:49,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:50,058 INFO L124 PetriNetUnfolderBase]: 933/1517 cut-off events. [2025-02-08 08:27:50,058 INFO L125 PetriNetUnfolderBase]: For 2194/2194 co-relation queries the response was YES. [2025-02-08 08:27:50,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4396 conditions, 1517 events. 933/1517 cut-off events. For 2194/2194 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6320 event pairs, 235 based on Foata normal form. 8/1525 useless extension candidates. Maximal degree in co-relation 4373. Up to 546 conditions per place. [2025-02-08 08:27:50,062 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 45 selfloop transitions, 4 changer transitions 47/101 dead transitions. [2025-02-08 08:27:50,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 636 flow [2025-02-08 08:27:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:27:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:27:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2025-02-08 08:27:50,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2025-02-08 08:27:50,063 INFO L175 Difference]: Start difference. First operand has 86 places, 49 transitions, 274 flow. Second operand 10 states and 180 transitions. [2025-02-08 08:27:50,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 636 flow [2025-02-08 08:27:50,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 101 transitions, 569 flow, removed 19 selfloop flow, removed 12 redundant places. [2025-02-08 08:27:50,066 INFO L231 Difference]: Finished difference. Result has 79 places, 41 transitions, 174 flow [2025-02-08 08:27:50,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=41} [2025-02-08 08:27:50,066 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-02-08 08:27:50,066 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 41 transitions, 174 flow [2025-02-08 08:27:50,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 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-02-08 08:27:50,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:50,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:50,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:27:50,067 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:50,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash 365932575, now seen corresponding path program 11 times [2025-02-08 08:27:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:50,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636933508] [2025-02-08 08:27:50,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:27:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:50,072 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:50,112 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:50,112 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:50,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:50,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:50,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:27:50,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:27:50,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:50,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:50,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:50,186 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:50,186 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:27:50,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:27:50,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:27:50,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:27:50,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:27:50,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:27:50,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:27:50,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 08:27:50,188 INFO L422 BasicCegarLoop]: Path program histogram: [11, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:50,241 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:27:50,242 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:27:50,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:27:50 BasicIcfg [2025-02-08 08:27:50,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:27:50,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:27:50,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:27:50,247 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:27:50,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:02" (3/4) ... [2025-02-08 08:27:50,250 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:27:50,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:27:50,251 INFO L158 Benchmark]: Toolchain (without parser) took 48511.38ms. Allocated memory was 201.3MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 154.7MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-02-08 08:27:50,252 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:27:50,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.40ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 129.0MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:27:50,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.74ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 126.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:27:50,252 INFO L158 Benchmark]: Boogie Preprocessor took 55.67ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 122.3MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:27:50,253 INFO L158 Benchmark]: IcfgBuilder took 676.22ms. Allocated memory is still 201.3MB. Free memory was 122.3MB in the beginning and 145.8MB in the end (delta: -23.5MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2025-02-08 08:27:50,253 INFO L158 Benchmark]: TraceAbstraction took 47307.52ms. Allocated memory was 201.3MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 144.7MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-02-08 08:27:50,253 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 3.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 776.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:27:50,255 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.51ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.40ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 129.0MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.74ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 126.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.67ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 122.3MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 676.22ms. Allocated memory is still 201.3MB. Free memory was 122.3MB in the beginning and 145.8MB in the end (delta: -23.5MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * TraceAbstraction took 47307.52ms. Allocated memory was 201.3MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 144.7MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 3.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 776.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 __assert_fail ("0", "safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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 7 procedures, 72 locations, 7 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: 47.2s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2321 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2313 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7482 IncrementalHoareTripleChecker+Invalid, 7825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 3 mSDtfsCounter, 7482 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2939occurred in iteration=12, InterpolantAutomatonStates: 234, 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.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 6058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 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-02-08 08:27:50,273 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-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:27:52,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:27:52,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:27:52,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:27:52,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:27:52,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:27:52,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:27:52,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:27:52,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:27:52,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:27:52,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:27:52,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:27:52,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:27:52,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:27:52,592 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:27:52,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:27:52,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:27:52,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:27:52,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:27:52,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:27:52,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:27:52,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:27:52,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:27:52,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:52,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:27:52,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:27:52,596 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2025-02-08 08:27:52,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:27:52,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:27:52,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:27:52,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:27:52,813 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:27:52,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:27:54,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b6532f44/64f30278ddd242db922addb6beba1421/FLAGf91b86e8a [2025-02-08 08:27:54,236 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:27:54,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:27:54,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b6532f44/64f30278ddd242db922addb6beba1421/FLAGf91b86e8a [2025-02-08 08:27:54,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b6532f44/64f30278ddd242db922addb6beba1421 [2025-02-08 08:27:54,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:27:54,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:27:54,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:54,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:27:54,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:27:54,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7b1be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54, skipping insertion in model container [2025-02-08 08:27:54,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:27:54,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:54,582 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:27:54,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:54,684 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:27:54,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54 WrapperNode [2025-02-08 08:27:54,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:54,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:54,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:27:54,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:27:54,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,725 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2025-02-08 08:27:54,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:54,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:27:54,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:27:54,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:27:54,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,752 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-02-08 08:27:54,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:27:54,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:27:54,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:27:54,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:27:54,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (1/1) ... [2025-02-08 08:27:54,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:54,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:54,795 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-02-08 08:27:54,797 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-02-08 08:27:54,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:27:54,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:27:54,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:27:54,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:27:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:27:54,817 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:27:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:27:54,817 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:27:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:27:54,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:27:54,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:27:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:27:54,819 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:27:54,918 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:27:54,920 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:27:55,309 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:27:55,309 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:27:55,566 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:27:55,567 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:27:55,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:55 BoogieIcfgContainer [2025-02-08 08:27:55,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:27:55,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:27:55,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:27:55,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:27:55,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:27:54" (1/3) ... [2025-02-08 08:27:55,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4278e723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:55, skipping insertion in model container [2025-02-08 08:27:55,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:54" (2/3) ... [2025-02-08 08:27:55,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4278e723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:55, skipping insertion in model container [2025-02-08 08:27:55,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:55" (3/3) ... [2025-02-08 08:27:55,577 INFO L128 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:27:55,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:27:55,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 45 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:27:55,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:27:55,635 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:55,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:27:55,690 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2025-02-08 08:27:55,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:55,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-08 08:27:55,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:27:55,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2025-02-08 08:27:55,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:55,720 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;@73f94ac0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:55,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:27:55,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:55,729 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-02-08 08:27:55,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:55,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:55,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:55,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash -501447140, now seen corresponding path program 1 times [2025-02-08 08:27:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:27:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183822206] [2025-02-08 08:27:55,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:55,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:27:55,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:55,747 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-02-08 08:27:55,749 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-02-08 08:27:55,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:27:55,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:27:55,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:55,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:55,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:27:55,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:27:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:55,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:27:55,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:27:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183822206] [2025-02-08 08:27:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183822206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:55,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:55,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576522359] [2025-02-08 08:27:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:55,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:27:55,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:55,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:55,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:55,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-08 08:27:55,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:55,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:55,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:56,986 INFO L124 PetriNetUnfolderBase]: 7377/10637 cut-off events. [2025-02-08 08:27:56,987 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 08:27:57,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21186 conditions, 10637 events. 7377/10637 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 59389 event pairs, 972 based on Foata normal form. 588/11220 useless extension candidates. Maximal degree in co-relation 21175. Up to 8856 conditions per place. [2025-02-08 08:27:57,034 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-08 08:27:57,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-02-08 08:27:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-08 08:27:57,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2025-02-08 08:27:57,043 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 88 transitions. [2025-02-08 08:27:57,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-02-08 08:27:57,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:27:57,049 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2025-02-08 08:27:57,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-02-08 08:27:57,053 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-02-08 08:27:57,053 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2025-02-08 08:27:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-08 08:27:57,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:57,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:57,060 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-02-08 08:27:57,254 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-02-08 08:27:57,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:57,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:57,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1819506938, now seen corresponding path program 1 times [2025-02-08 08:27:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:27:57,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833906710] [2025-02-08 08:27:57,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:57,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:27:57,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:57,259 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-02-08 08:27:57,260 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-02-08 08:27:57,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:57,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:57,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:57,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:57,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:27:57,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:27:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:57,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:27:57,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:27:57,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833906710] [2025-02-08 08:27:57,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833906710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:57,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:57,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:57,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829303505] [2025-02-08 08:27:57,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:57,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:57,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:27:57,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:57,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:57,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:27:57,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:57,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:57,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:27:57,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:58,137 INFO L124 PetriNetUnfolderBase]: 6628/10280 cut-off events. [2025-02-08 08:27:58,137 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2025-02-08 08:27:58,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20226 conditions, 10280 events. 6628/10280 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 62822 event pairs, 6628 based on Foata normal form. 294/10569 useless extension candidates. Maximal degree in co-relation 20216. Up to 9387 conditions per place. [2025-02-08 08:27:58,185 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-02-08 08:27:58,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2025-02-08 08:27:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-08 08:27:58,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2025-02-08 08:27:58,187 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2025-02-08 08:27:58,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2025-02-08 08:27:58,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:27:58,189 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2025-02-08 08:27:58,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-08 08:27:58,190 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-02-08 08:27:58,190 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2025-02-08 08:27:58,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:58,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:58,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:58,197 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-02-08 08:27:58,391 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-02-08 08:27:58,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1819506008, now seen corresponding path program 1 times [2025-02-08 08:27:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:27:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493059351] [2025-02-08 08:27:58,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:27:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:58,394 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-02-08 08:27:58,396 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-02-08 08:27:58,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:58,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:58,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:58,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:58,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:27:58,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:27:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:58,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:27:58,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:27:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493059351] [2025-02-08 08:27:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493059351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:58,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:58,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:27:58,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318964442] [2025-02-08 08:27:58,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:58,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:27:58,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:27:58,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:27:58,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:27:58,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:58,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-08 08:27:58,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:58,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:58,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:59,085 INFO L124 PetriNetUnfolderBase]: 4634/7386 cut-off events. [2025-02-08 08:27:59,086 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:59,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14297 conditions, 7386 events. 4634/7386 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 44446 event pairs, 818 based on Foata normal form. 294/7675 useless extension candidates. Maximal degree in co-relation 14291. Up to 3859 conditions per place. [2025-02-08 08:27:59,111 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 61 selfloop transitions, 5 changer transitions 1/73 dead transitions. [2025-02-08 08:27:59,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 292 flow [2025-02-08 08:27:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:27:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:27:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-02-08 08:27:59,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2025-02-08 08:27:59,114 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 4 states and 109 transitions. [2025-02-08 08:27:59,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 292 flow [2025-02-08 08:27:59,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:27:59,116 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2025-02-08 08:27:59,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-08 08:27:59,116 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2025-02-08 08:27:59,116 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2025-02-08 08:27:59,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-08 08:27:59,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:59,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:59,124 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-02-08 08:27:59,322 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-02-08 08:27:59,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1431633091, now seen corresponding path program 1 times [2025-02-08 08:27:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:27:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5800053] [2025-02-08 08:27:59,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:59,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:27:59,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:59,325 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-02-08 08:27:59,326 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-02-08 08:27:59,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:27:59,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:27:59,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:59,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:59,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:27:59,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:27:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:59,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:27:59,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:27:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5800053] [2025-02-08 08:27:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5800053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:59,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:59,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:27:59,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708966013] [2025-02-08 08:27:59,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:59,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:27:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:27:59,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:27:59,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:27:59,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:27:59,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:59,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:59,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:27:59,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:59,746 INFO L124 PetriNetUnfolderBase]: 2514/3996 cut-off events. [2025-02-08 08:27:59,746 INFO L125 PetriNetUnfolderBase]: For 707/707 co-relation queries the response was YES. [2025-02-08 08:27:59,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9014 conditions, 3996 events. 2514/3996 cut-off events. For 707/707 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 20593 event pairs, 536 based on Foata normal form. 194/4185 useless extension candidates. Maximal degree in co-relation 9005. Up to 1317 conditions per place. [2025-02-08 08:27:59,759 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 78 selfloop transitions, 8 changer transitions 1/93 dead transitions. [2025-02-08 08:27:59,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 416 flow [2025-02-08 08:27:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:27:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:27:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-02-08 08:27:59,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2025-02-08 08:27:59,761 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 5 states and 139 transitions. [2025-02-08 08:27:59,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 416 flow [2025-02-08 08:27:59,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 406 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:27:59,764 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 153 flow [2025-02-08 08:27:59,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-02-08 08:27:59,765 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-02-08 08:27:59,765 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 153 flow [2025-02-08 08:27:59,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:59,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:59,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:59,772 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-02-08 08:27:59,970 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-02-08 08:27:59,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1660146650, now seen corresponding path program 1 times [2025-02-08 08:27:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:27:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079331804] [2025-02-08 08:27:59,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:59,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:27:59,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:59,973 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-02-08 08:27:59,973 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-02-08 08:28:00,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:28:00,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:28:00,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:00,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:00,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:28:00,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:00,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-02-08 08:28:00,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:00,089 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:00,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079331804] [2025-02-08 08:28:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079331804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:00,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:28:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406302332] [2025-02-08 08:28:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:00,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:00,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:00,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:00,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:00,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-08 08:28:00,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:00,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:00,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:00,400 INFO L124 PetriNetUnfolderBase]: 1573/2421 cut-off events. [2025-02-08 08:28:00,400 INFO L125 PetriNetUnfolderBase]: For 1332/1332 co-relation queries the response was YES. [2025-02-08 08:28:00,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 2421 events. 1573/2421 cut-off events. For 1332/1332 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10999 event pairs, 487 based on Foata normal form. 64/2480 useless extension candidates. Maximal degree in co-relation 5959. Up to 918 conditions per place. [2025-02-08 08:28:00,409 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 65 selfloop transitions, 11 changer transitions 1/83 dead transitions. [2025-02-08 08:28:00,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 399 flow [2025-02-08 08:28:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:28:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:28:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-02-08 08:28:00,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2025-02-08 08:28:00,412 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 153 flow. Second operand 6 states and 139 transitions. [2025-02-08 08:28:00,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 399 flow [2025-02-08 08:28:00,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 374 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:28:00,422 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 167 flow [2025-02-08 08:28:00,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-02-08 08:28:00,423 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2025-02-08 08:28:00,423 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 167 flow [2025-02-08 08:28:00,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-08 08:28:00,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:00,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:00,434 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-02-08 08:28:00,623 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-02-08 08:28:00,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:00,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 716894669, now seen corresponding path program 1 times [2025-02-08 08:28:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:00,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343133011] [2025-02-08 08:28:00,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:00,627 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-02-08 08:28:00,628 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-02-08 08:28:00,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:00,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:00,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:00,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:28:00,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:00,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:00,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343133011] [2025-02-08 08:28:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343133011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:00,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:28:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82605] [2025-02-08 08:28:00,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:28:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:00,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:28:00,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:28:00,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:00,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 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-02-08 08:28:00,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:00,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:00,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:01,418 INFO L124 PetriNetUnfolderBase]: 2145/3313 cut-off events. [2025-02-08 08:28:01,418 INFO L125 PetriNetUnfolderBase]: For 2224/2224 co-relation queries the response was YES. [2025-02-08 08:28:01,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 3313 events. 2145/3313 cut-off events. For 2224/2224 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15755 event pairs, 465 based on Foata normal form. 8/3316 useless extension candidates. Maximal degree in co-relation 8339. Up to 1952 conditions per place. [2025-02-08 08:28:01,428 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 52 selfloop transitions, 8 changer transitions 60/126 dead transitions. [2025-02-08 08:28:01,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 695 flow [2025-02-08 08:28:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:28:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:28:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-02-08 08:28:01,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43873517786561267 [2025-02-08 08:28:01,430 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 167 flow. Second operand 11 states and 222 transitions. [2025-02-08 08:28:01,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 695 flow [2025-02-08 08:28:01,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 126 transitions, 562 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-08 08:28:01,443 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 185 flow [2025-02-08 08:28:01,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=185, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2025-02-08 08:28:01,446 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-02-08 08:28:01,446 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 185 flow [2025-02-08 08:28:01,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 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-02-08 08:28:01,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:01,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:01,454 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-02-08 08:28:01,647 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-02-08 08:28:01,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:01,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -830194359, now seen corresponding path program 2 times [2025-02-08 08:28:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:01,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269346125] [2025-02-08 08:28:01,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:01,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:01,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:01,651 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-02-08 08:28:01,652 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-02-08 08:28:01,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:01,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:01,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:01,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:01,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:28:01,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:02,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:02,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269346125] [2025-02-08 08:28:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269346125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:02,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:02,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:28:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100633431] [2025-02-08 08:28:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:02,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:02,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:02,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:02,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:02,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 185 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:02,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:02,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:02,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:02,654 INFO L124 PetriNetUnfolderBase]: 2027/3135 cut-off events. [2025-02-08 08:28:02,655 INFO L125 PetriNetUnfolderBase]: For 1287/1287 co-relation queries the response was YES. [2025-02-08 08:28:02,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7888 conditions, 3135 events. 2027/3135 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14843 event pairs, 360 based on Foata normal form. 8/3139 useless extension candidates. Maximal degree in co-relation 7871. Up to 1952 conditions per place. [2025-02-08 08:28:02,671 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 53 selfloop transitions, 9 changer transitions 51/119 dead transitions. [2025-02-08 08:28:02,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 119 transitions, 623 flow [2025-02-08 08:28:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:28:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:28:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2025-02-08 08:28:02,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44130434782608696 [2025-02-08 08:28:02,673 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 185 flow. Second operand 10 states and 203 transitions. [2025-02-08 08:28:02,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 119 transitions, 623 flow [2025-02-08 08:28:02,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 119 transitions, 595 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-02-08 08:28:02,678 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 221 flow [2025-02-08 08:28:02,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2025-02-08 08:28:02,679 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2025-02-08 08:28:02,679 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 221 flow [2025-02-08 08:28:02,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:02,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:02,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:02,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:02,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:02,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:02,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1478182247, now seen corresponding path program 3 times [2025-02-08 08:28:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529948444] [2025-02-08 08:28:02,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:28:02,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:02,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:02,882 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-02-08 08:28:02,884 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-02-08 08:28:02,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:02,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:02,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:28:02,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:02,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:28:02,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:03,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:03,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:03,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529948444] [2025-02-08 08:28:03,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529948444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:03,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:03,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:28:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631615556] [2025-02-08 08:28:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:03,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:03,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:03,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:03,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:03,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-02-08 08:28:03,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:03,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:03,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:03,449 INFO L124 PetriNetUnfolderBase]: 2153/3320 cut-off events. [2025-02-08 08:28:03,449 INFO L125 PetriNetUnfolderBase]: For 1869/1869 co-relation queries the response was YES. [2025-02-08 08:28:03,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8582 conditions, 3320 events. 2153/3320 cut-off events. For 1869/1869 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16499 event pairs, 815 based on Foata normal form. 8/3324 useless extension candidates. Maximal degree in co-relation 8564. Up to 1975 conditions per place. [2025-02-08 08:28:03,456 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 52 selfloop transitions, 2 changer transitions 27/87 dead transitions. [2025-02-08 08:28:03,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 498 flow [2025-02-08 08:28:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:28:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:28:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-02-08 08:28:03,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4384057971014493 [2025-02-08 08:28:03,457 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 221 flow. Second operand 6 states and 121 transitions. [2025-02-08 08:28:03,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 498 flow [2025-02-08 08:28:03,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 464 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-02-08 08:28:03,460 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 187 flow [2025-02-08 08:28:03,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2025-02-08 08:28:03,461 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-02-08 08:28:03,461 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 187 flow [2025-02-08 08:28:03,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-02-08 08:28:03,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:03,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:03,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:03,661 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 [2025-02-08 08:28:03,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:03,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash -689385589, now seen corresponding path program 4 times [2025-02-08 08:28:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539247052] [2025-02-08 08:28:03,662 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:28:03,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:03,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:03,664 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-02-08 08:28:03,665 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-02-08 08:28:03,718 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 08:28:03,736 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-02-08 08:28:03,736 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:28:03,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:03,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:28:03,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:03,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:03,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539247052] [2025-02-08 08:28:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539247052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:03,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:03,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:28:03,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088420984] [2025-02-08 08:28:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:28:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:03,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:28:03,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:28:03,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:03,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:28:03,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:03,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:03,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:04,301 INFO L124 PetriNetUnfolderBase]: 1833/2870 cut-off events. [2025-02-08 08:28:04,301 INFO L125 PetriNetUnfolderBase]: For 1071/1071 co-relation queries the response was YES. [2025-02-08 08:28:04,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7093 conditions, 2870 events. 1833/2870 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13591 event pairs, 500 based on Foata normal form. 8/2877 useless extension candidates. Maximal degree in co-relation 7076. Up to 1348 conditions per place. [2025-02-08 08:28:04,310 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 51 selfloop transitions, 12 changer transitions 60/129 dead transitions. [2025-02-08 08:28:04,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 694 flow [2025-02-08 08:28:04,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:28:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:28:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2025-02-08 08:28:04,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43043478260869567 [2025-02-08 08:28:04,312 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 187 flow. Second operand 10 states and 198 transitions. [2025-02-08 08:28:04,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 694 flow [2025-02-08 08:28:04,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 652 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-02-08 08:28:04,317 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 256 flow [2025-02-08 08:28:04,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2025-02-08 08:28:04,318 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-02-08 08:28:04,318 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 256 flow [2025-02-08 08:28:04,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:28:04,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:04,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:04,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:04,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:04,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1997175181, now seen corresponding path program 5 times [2025-02-08 08:28:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179184531] [2025-02-08 08:28:04,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:28:04,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:04,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:04,522 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-02-08 08:28:04,523 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-02-08 08:28:04,575 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:04,594 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:04,594 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:04,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:04,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:28:04,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:04,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:04,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179184531] [2025-02-08 08:28:04,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179184531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:04,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:28:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274623420] [2025-02-08 08:28:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:28:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:04,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:28:04,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:28:04,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:04,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 256 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:04,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:04,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:04,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:05,364 INFO L124 PetriNetUnfolderBase]: 1479/2339 cut-off events. [2025-02-08 08:28:05,365 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2025-02-08 08:28:05,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6293 conditions, 2339 events. 1479/2339 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10556 event pairs, 458 based on Foata normal form. 8/2346 useless extension candidates. Maximal degree in co-relation 6273. Up to 1662 conditions per place. [2025-02-08 08:28:05,372 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 53 selfloop transitions, 9 changer transitions 47/115 dead transitions. [2025-02-08 08:28:05,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 115 transitions, 671 flow [2025-02-08 08:28:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:28:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:28:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2025-02-08 08:28:05,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893280632411067 [2025-02-08 08:28:05,374 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 256 flow. Second operand 11 states and 197 transitions. [2025-02-08 08:28:05,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 115 transitions, 671 flow [2025-02-08 08:28:05,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 639 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-02-08 08:28:05,379 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 283 flow [2025-02-08 08:28:05,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=283, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2025-02-08 08:28:05,382 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2025-02-08 08:28:05,382 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 283 flow [2025-02-08 08:28:05,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:05,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:05,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:05,389 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-02-08 08:28:05,583 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 [2025-02-08 08:28:05,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:05,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash 660465197, now seen corresponding path program 6 times [2025-02-08 08:28:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600916502] [2025-02-08 08:28:05,584 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:28:05,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:05,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:05,586 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-02-08 08:28:05,588 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-02-08 08:28:05,641 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:05,658 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:05,658 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:28:05,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:05,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:28:05,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:05,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:05,850 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600916502] [2025-02-08 08:28:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600916502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:05,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:05,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:28:05,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95094863] [2025-02-08 08:28:05,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:05,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:05,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:05,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:05,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:05,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:05,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 283 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:05,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:05,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:05,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:06,365 INFO L124 PetriNetUnfolderBase]: 2083/3284 cut-off events. [2025-02-08 08:28:06,365 INFO L125 PetriNetUnfolderBase]: For 2512/2512 co-relation queries the response was YES. [2025-02-08 08:28:06,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9017 conditions, 3284 events. 2083/3284 cut-off events. For 2512/2512 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16350 event pairs, 345 based on Foata normal form. 8/3291 useless extension candidates. Maximal degree in co-relation 8994. Up to 1138 conditions per place. [2025-02-08 08:28:06,378 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 73 selfloop transitions, 16 changer transitions 52/147 dead transitions. [2025-02-08 08:28:06,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 885 flow [2025-02-08 08:28:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:28:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:28:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2025-02-08 08:28:06,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41699604743083 [2025-02-08 08:28:06,379 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 283 flow. Second operand 11 states and 211 transitions. [2025-02-08 08:28:06,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 885 flow [2025-02-08 08:28:06,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 147 transitions, 847 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-02-08 08:28:06,384 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 359 flow [2025-02-08 08:28:06,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=359, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2025-02-08 08:28:06,385 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-02-08 08:28:06,385 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 359 flow [2025-02-08 08:28:06,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:06,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:06,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:06,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 08:28:06,585 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 [2025-02-08 08:28:06,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:06,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1990186581, now seen corresponding path program 7 times [2025-02-08 08:28:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143128836] [2025-02-08 08:28:06,587 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:28:06,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:06,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:06,588 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-02-08 08:28:06,590 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-02-08 08:28:06,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:06,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:06,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:28:06,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:06,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:06,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143128836] [2025-02-08 08:28:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143128836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:28:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217168560] [2025-02-08 08:28:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:06,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:28:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:06,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:28:06,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:28:06,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:06,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 359 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:06,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:06,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:07,459 INFO L124 PetriNetUnfolderBase]: 1861/2949 cut-off events. [2025-02-08 08:28:07,459 INFO L125 PetriNetUnfolderBase]: For 4774/4774 co-relation queries the response was YES. [2025-02-08 08:28:07,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9118 conditions, 2949 events. 1861/2949 cut-off events. For 4774/4774 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14289 event pairs, 716 based on Foata normal form. 8/2956 useless extension candidates. Maximal degree in co-relation 9093. Up to 2404 conditions per place. [2025-02-08 08:28:07,472 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 59 selfloop transitions, 8 changer transitions 43/116 dead transitions. [2025-02-08 08:28:07,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 767 flow [2025-02-08 08:28:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:28:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:28:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-02-08 08:28:07,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3794466403162055 [2025-02-08 08:28:07,474 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 359 flow. Second operand 11 states and 192 transitions. [2025-02-08 08:28:07,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 767 flow [2025-02-08 08:28:07,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 116 transitions, 699 flow, removed 22 selfloop flow, removed 10 redundant places. [2025-02-08 08:28:07,485 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 335 flow [2025-02-08 08:28:07,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=335, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2025-02-08 08:28:07,485 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-02-08 08:28:07,486 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 335 flow [2025-02-08 08:28:07,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:07,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:07,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:07,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:07,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:07,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:07,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash 745945789, now seen corresponding path program 8 times [2025-02-08 08:28:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:07,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363485201] [2025-02-08 08:28:07,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:07,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:07,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:07,689 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:07,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 08:28:07,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:07,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:07,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:07,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:07,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:28:07,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:07,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:07,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363485201] [2025-02-08 08:28:07,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363485201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:07,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:28:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529306092] [2025-02-08 08:28:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:07,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:07,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:07,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:07,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 335 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:07,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:07,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:07,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:08,442 INFO L124 PetriNetUnfolderBase]: 2268/3583 cut-off events. [2025-02-08 08:28:08,443 INFO L125 PetriNetUnfolderBase]: For 4164/4164 co-relation queries the response was YES. [2025-02-08 08:28:08,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10414 conditions, 3583 events. 2268/3583 cut-off events. For 4164/4164 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18233 event pairs, 584 based on Foata normal form. 8/3590 useless extension candidates. Maximal degree in co-relation 10390. Up to 1822 conditions per place. [2025-02-08 08:28:08,454 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 75 selfloop transitions, 10 changer transitions 40/131 dead transitions. [2025-02-08 08:28:08,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 845 flow [2025-02-08 08:28:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:28:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:28:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2025-02-08 08:28:08,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4108695652173913 [2025-02-08 08:28:08,455 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 335 flow. Second operand 10 states and 189 transitions. [2025-02-08 08:28:08,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 845 flow [2025-02-08 08:28:08,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 131 transitions, 801 flow, removed 13 selfloop flow, removed 11 redundant places. [2025-02-08 08:28:08,460 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 301 flow [2025-02-08 08:28:08,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=301, PETRI_PLACES=81, PETRI_TRANSITIONS=57} [2025-02-08 08:28:08,461 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-02-08 08:28:08,461 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 301 flow [2025-02-08 08:28:08,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:08,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:08,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:08,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:08,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:08,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:08,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 257024011, now seen corresponding path program 9 times [2025-02-08 08:28:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518493186] [2025-02-08 08:28:08,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:28:08,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:08,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:08,664 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:08,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 08:28:08,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:08,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:08,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:28:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:08,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 08:28:08,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:09,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:09,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:09,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518493186] [2025-02-08 08:28:09,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518493186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:09,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:09,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:28:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703494854] [2025-02-08 08:28:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:09,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:28:09,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:09,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:28:09,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:28:09,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:09,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 301 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:09,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:09,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:09,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:09,511 INFO L124 PetriNetUnfolderBase]: 2361/3737 cut-off events. [2025-02-08 08:28:09,511 INFO L125 PetriNetUnfolderBase]: For 4938/4938 co-relation queries the response was YES. [2025-02-08 08:28:09,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 3737 events. 2361/3737 cut-off events. For 4938/4938 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19038 event pairs, 958 based on Foata normal form. 8/3744 useless extension candidates. Maximal degree in co-relation 10787. Up to 2760 conditions per place. [2025-02-08 08:28:09,523 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 69 selfloop transitions, 8 changer transitions 46/129 dead transitions. [2025-02-08 08:28:09,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 840 flow [2025-02-08 08:28:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:28:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:28:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-02-08 08:28:09,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39920948616600793 [2025-02-08 08:28:09,524 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 301 flow. Second operand 11 states and 202 transitions. [2025-02-08 08:28:09,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 840 flow [2025-02-08 08:28:09,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 129 transitions, 786 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-02-08 08:28:09,529 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 326 flow [2025-02-08 08:28:09,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=326, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2025-02-08 08:28:09,529 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-02-08 08:28:09,529 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 326 flow [2025-02-08 08:28:09,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:09,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:09,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:09,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:09,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:09,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:09,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1097024961, now seen corresponding path program 10 times [2025-02-08 08:28:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:09,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224195116] [2025-02-08 08:28:09,731 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:28:09,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:09,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:09,732 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:09,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 08:28:09,777 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 08:28:09,790 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-02-08 08:28:09,790 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:28:09,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:09,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 08:28:09,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:10,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:10,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224195116] [2025-02-08 08:28:10,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224195116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:10,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:10,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:28:10,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478236998] [2025-02-08 08:28:10,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:10,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:28:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:10,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:28:10,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:28:10,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:10,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 326 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:28:10,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:10,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:10,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:10,476 INFO L124 PetriNetUnfolderBase]: 2321/3678 cut-off events. [2025-02-08 08:28:10,477 INFO L125 PetriNetUnfolderBase]: For 5031/5031 co-relation queries the response was YES. [2025-02-08 08:28:10,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10984 conditions, 3678 events. 2321/3678 cut-off events. For 5031/5031 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18796 event pairs, 585 based on Foata normal form. 8/3685 useless extension candidates. Maximal degree in co-relation 10960. Up to 2565 conditions per place. [2025-02-08 08:28:10,490 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 61 selfloop transitions, 13 changer transitions 36/116 dead transitions. [2025-02-08 08:28:10,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 812 flow [2025-02-08 08:28:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:28:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:28:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2025-02-08 08:28:10,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-02-08 08:28:10,491 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 326 flow. Second operand 8 states and 161 transitions. [2025-02-08 08:28:10,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 812 flow [2025-02-08 08:28:10,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 764 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-02-08 08:28:10,500 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 420 flow [2025-02-08 08:28:10,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-02-08 08:28:10,500 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-02-08 08:28:10,500 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 420 flow [2025-02-08 08:28:10,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:28:10,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:10,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:10,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 08:28:10,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:10,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:10,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:10,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1562067051, now seen corresponding path program 11 times [2025-02-08 08:28:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:10,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402346057] [2025-02-08 08:28:10,702 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:28:10,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:10,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:10,703 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:10,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 08:28:10,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:10,763 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:10,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:10,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:28:10,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:10,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:10,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:10,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402346057] [2025-02-08 08:28:10,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402346057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:10,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:10,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:28:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082581257] [2025-02-08 08:28:10,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:10,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:10,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:10,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:10,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 420 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:10,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:10,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:10,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:11,296 INFO L124 PetriNetUnfolderBase]: 2400/3810 cut-off events. [2025-02-08 08:28:11,296 INFO L125 PetriNetUnfolderBase]: For 6038/6038 co-relation queries the response was YES. [2025-02-08 08:28:11,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11547 conditions, 3810 events. 2400/3810 cut-off events. For 6038/6038 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19796 event pairs, 1046 based on Foata normal form. 8/3817 useless extension candidates. Maximal degree in co-relation 11521. Up to 2691 conditions per place. [2025-02-08 08:28:11,310 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 60 selfloop transitions, 5 changer transitions 46/117 dead transitions. [2025-02-08 08:28:11,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 858 flow [2025-02-08 08:28:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:28:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:28:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2025-02-08 08:28:11,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2025-02-08 08:28:11,311 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 420 flow. Second operand 10 states and 176 transitions. [2025-02-08 08:28:11,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 858 flow [2025-02-08 08:28:11,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 800 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-02-08 08:28:11,318 INFO L231 Difference]: Finished difference. Result has 89 places, 63 transitions, 382 flow [2025-02-08 08:28:11,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=382, PETRI_PLACES=89, PETRI_TRANSITIONS=63} [2025-02-08 08:28:11,319 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2025-02-08 08:28:11,319 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 63 transitions, 382 flow [2025-02-08 08:28:11,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:11,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:11,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:11,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:11,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:11,520 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:11,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2073131205, now seen corresponding path program 12 times [2025-02-08 08:28:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782374058] [2025-02-08 08:28:11,520 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:28:11,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:11,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:11,522 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:11,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 08:28:11,570 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:11,586 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:11,586 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:28:11,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:11,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:28:11,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:11,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:11,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782374058] [2025-02-08 08:28:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782374058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:11,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:28:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062898740] [2025-02-08 08:28:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:11,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:11,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:11,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:11,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:11,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 63 transitions, 382 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:11,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:11,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:11,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:12,122 INFO L124 PetriNetUnfolderBase]: 2187/3481 cut-off events. [2025-02-08 08:28:12,122 INFO L125 PetriNetUnfolderBase]: For 4578/4578 co-relation queries the response was YES. [2025-02-08 08:28:12,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 3481 events. 2187/3481 cut-off events. For 4578/4578 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17684 event pairs, 1008 based on Foata normal form. 8/3488 useless extension candidates. Maximal degree in co-relation 10031. Up to 2549 conditions per place. [2025-02-08 08:28:12,137 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 50 selfloop transitions, 2 changer transitions 56/114 dead transitions. [2025-02-08 08:28:12,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 776 flow [2025-02-08 08:28:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:28:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:28:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2025-02-08 08:28:12,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3847826086956522 [2025-02-08 08:28:12,138 INFO L175 Difference]: Start difference. First operand has 89 places, 63 transitions, 382 flow. Second operand 10 states and 177 transitions. [2025-02-08 08:28:12,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 776 flow [2025-02-08 08:28:12,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 114 transitions, 733 flow, removed 13 selfloop flow, removed 12 redundant places. [2025-02-08 08:28:12,143 INFO L231 Difference]: Finished difference. Result has 86 places, 57 transitions, 303 flow [2025-02-08 08:28:12,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=303, PETRI_PLACES=86, PETRI_TRANSITIONS=57} [2025-02-08 08:28:12,144 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2025-02-08 08:28:12,144 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 57 transitions, 303 flow [2025-02-08 08:28:12,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:12,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:12,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:12,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 08:28:12,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:12,344 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:12,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash -302331023, now seen corresponding path program 13 times [2025-02-08 08:28:12,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:12,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192795520] [2025-02-08 08:28:12,345 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:28:12,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:12,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:12,347 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:12,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 08:28:12,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:12,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:12,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:12,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:12,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:28:12,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:12,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:12,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:12,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192795520] [2025-02-08 08:28:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192795520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:12,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:28:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699203778] [2025-02-08 08:28:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:12,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:28:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:12,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:28:12,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:28:12,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:12,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 57 transitions, 303 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:12,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:12,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:12,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:13,139 INFO L124 PetriNetUnfolderBase]: 2052/3270 cut-off events. [2025-02-08 08:28:13,139 INFO L125 PetriNetUnfolderBase]: For 3902/3902 co-relation queries the response was YES. [2025-02-08 08:28:13,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9314 conditions, 3270 events. 2052/3270 cut-off events. For 3902/3902 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16495 event pairs, 622 based on Foata normal form. 8/3278 useless extension candidates. Maximal degree in co-relation 9287. Up to 2273 conditions per place. [2025-02-08 08:28:13,154 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 70 selfloop transitions, 10 changer transitions 46/132 dead transitions. [2025-02-08 08:28:13,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 132 transitions, 860 flow [2025-02-08 08:28:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:28:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:28:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2025-02-08 08:28:13,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4031620553359684 [2025-02-08 08:28:13,156 INFO L175 Difference]: Start difference. First operand has 86 places, 57 transitions, 303 flow. Second operand 11 states and 204 transitions. [2025-02-08 08:28:13,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 132 transitions, 860 flow [2025-02-08 08:28:13,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 132 transitions, 798 flow, removed 27 selfloop flow, removed 12 redundant places. [2025-02-08 08:28:13,162 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 334 flow [2025-02-08 08:28:13,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=334, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2025-02-08 08:28:13,162 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-02-08 08:28:13,162 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 334 flow [2025-02-08 08:28:13,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-02-08 08:28:13,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:13,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:13,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:13,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:13,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:13,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1870701863, now seen corresponding path program 14 times [2025-02-08 08:28:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:13,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894657704] [2025-02-08 08:28:13,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:13,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:13,365 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:13,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 08:28:13,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:13,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:13,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:13,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:13,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:28:13,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:13,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:13,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894657704] [2025-02-08 08:28:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894657704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:13,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:13,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:28:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327323997] [2025-02-08 08:28:13,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:13,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:13,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:13,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:13,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:13,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 334 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:13,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:13,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:13,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:14,004 INFO L124 PetriNetUnfolderBase]: 1966/3112 cut-off events. [2025-02-08 08:28:14,004 INFO L125 PetriNetUnfolderBase]: For 3630/3630 co-relation queries the response was YES. [2025-02-08 08:28:14,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9044 conditions, 3112 events. 1966/3112 cut-off events. For 3630/3630 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15220 event pairs, 600 based on Foata normal form. 8/3120 useless extension candidates. Maximal degree in co-relation 9021. Up to 1881 conditions per place. [2025-02-08 08:28:14,013 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 60 selfloop transitions, 7 changer transitions 55/128 dead transitions. [2025-02-08 08:28:14,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 843 flow [2025-02-08 08:28:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:28:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:28:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2025-02-08 08:28:14,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4108695652173913 [2025-02-08 08:28:14,014 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 334 flow. Second operand 10 states and 189 transitions. [2025-02-08 08:28:14,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 843 flow [2025-02-08 08:28:14,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 799 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-02-08 08:28:14,018 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 305 flow [2025-02-08 08:28:14,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=305, PETRI_PLACES=80, PETRI_TRANSITIONS=56} [2025-02-08 08:28:14,018 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2025-02-08 08:28:14,018 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 305 flow [2025-02-08 08:28:14,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:14,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:14,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:14,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-08 08:28:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:14,219 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:14,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash -554653983, now seen corresponding path program 15 times [2025-02-08 08:28:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212696629] [2025-02-08 08:28:14,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:28:14,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:14,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:14,222 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:14,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 08:28:14,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:14,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:14,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:28:14,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:14,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:28:14,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:14,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:14,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:14,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212696629] [2025-02-08 08:28:14,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212696629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:14,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:14,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:28:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212828907] [2025-02-08 08:28:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:14,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:28:14,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:14,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:28:14,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:28:14,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:14,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 305 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 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-02-08 08:28:14,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:14,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:14,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:14,915 INFO L124 PetriNetUnfolderBase]: 1491/2371 cut-off events. [2025-02-08 08:28:14,915 INFO L125 PetriNetUnfolderBase]: For 2316/2316 co-relation queries the response was YES. [2025-02-08 08:28:14,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6677 conditions, 2371 events. 1491/2371 cut-off events. For 2316/2316 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10944 event pairs, 380 based on Foata normal form. 8/2379 useless extension candidates. Maximal degree in co-relation 6655. Up to 1063 conditions per place. [2025-02-08 08:28:14,924 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 67 selfloop transitions, 10 changer transitions 36/119 dead transitions. [2025-02-08 08:28:14,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 729 flow [2025-02-08 08:28:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:28:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:28:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-02-08 08:28:14,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38735177865612647 [2025-02-08 08:28:14,925 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 305 flow. Second operand 11 states and 196 transitions. [2025-02-08 08:28:14,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 729 flow [2025-02-08 08:28:14,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 669 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-02-08 08:28:14,928 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 283 flow [2025-02-08 08:28:14,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=283, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2025-02-08 08:28:14,928 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-02-08 08:28:14,928 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 283 flow [2025-02-08 08:28:14,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 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-02-08 08:28:14,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:14,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:14,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-08 08:28:15,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:15,129 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash 840606813, now seen corresponding path program 16 times [2025-02-08 08:28:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186704474] [2025-02-08 08:28:15,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:28:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:15,131 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:15,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-08 08:28:15,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 08:28:15,197 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-02-08 08:28:15,197 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:28:15,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:15,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:28:15,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:15,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:15,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:15,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186704474] [2025-02-08 08:28:15,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186704474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:15,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:15,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:28:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732777196] [2025-02-08 08:28:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:15,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:15,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:15,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:15,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:15,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 283 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:15,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:15,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:15,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:15,592 INFO L124 PetriNetUnfolderBase]: 1427/2283 cut-off events. [2025-02-08 08:28:15,592 INFO L125 PetriNetUnfolderBase]: For 2617/2617 co-relation queries the response was YES. [2025-02-08 08:28:15,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6438 conditions, 2283 events. 1427/2283 cut-off events. For 2617/2617 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10354 event pairs, 637 based on Foata normal form. 8/2291 useless extension candidates. Maximal degree in co-relation 6417. Up to 1581 conditions per place. [2025-02-08 08:28:15,599 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 45 selfloop transitions, 3 changer transitions 44/98 dead transitions. [2025-02-08 08:28:15,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 611 flow [2025-02-08 08:28:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:28:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:28:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2025-02-08 08:28:15,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-02-08 08:28:15,600 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 283 flow. Second operand 9 states and 161 transitions. [2025-02-08 08:28:15,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 611 flow [2025-02-08 08:28:15,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 571 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-02-08 08:28:15,603 INFO L231 Difference]: Finished difference. Result has 78 places, 52 transitions, 239 flow [2025-02-08 08:28:15,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=78, PETRI_TRANSITIONS=52} [2025-02-08 08:28:15,603 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2025-02-08 08:28:15,603 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 52 transitions, 239 flow [2025-02-08 08:28:15,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:15,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:15,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:15,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-08 08:28:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:15,804 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:15,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash -164426811, now seen corresponding path program 17 times [2025-02-08 08:28:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385903156] [2025-02-08 08:28:15,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:28:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:15,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:15,806 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:15,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-08 08:28:15,856 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:15,871 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:15,871 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:15,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:15,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 08:28:15,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:16,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:16,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:16,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385903156] [2025-02-08 08:28:16,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385903156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:16,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:16,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:28:16,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39013730] [2025-02-08 08:28:16,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:16,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:28:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:16,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:28:16,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:28:16,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:16,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 52 transitions, 239 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:16,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:16,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:16,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:16,634 INFO L124 PetriNetUnfolderBase]: 1316/2118 cut-off events. [2025-02-08 08:28:16,634 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2025-02-08 08:28:16,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 2118 events. 1316/2118 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9779 event pairs, 336 based on Foata normal form. 8/2126 useless extension candidates. Maximal degree in co-relation 5755. Up to 1383 conditions per place. [2025-02-08 08:28:16,641 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 67 selfloop transitions, 18 changer transitions 40/131 dead transitions. [2025-02-08 08:28:16,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 131 transitions, 818 flow [2025-02-08 08:28:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:28:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 08:28:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 248 transitions. [2025-02-08 08:28:16,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38509316770186336 [2025-02-08 08:28:16,642 INFO L175 Difference]: Start difference. First operand has 78 places, 52 transitions, 239 flow. Second operand 14 states and 248 transitions. [2025-02-08 08:28:16,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 131 transitions, 818 flow [2025-02-08 08:28:16,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 749 flow, removed 17 selfloop flow, removed 13 redundant places. [2025-02-08 08:28:16,645 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 386 flow [2025-02-08 08:28:16,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=386, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-02-08 08:28:16,646 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-02-08 08:28:16,646 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 386 flow [2025-02-08 08:28:16,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:16,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:16,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:16,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-02-08 08:28:16,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:16,846 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:16,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2036901499, now seen corresponding path program 18 times [2025-02-08 08:28:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:16,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622581424] [2025-02-08 08:28:16,847 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:28:16,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:16,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:16,849 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:16,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-08 08:28:16,896 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:16,911 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:16,912 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:28:16,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:16,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 08:28:16,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:17,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:17,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622581424] [2025-02-08 08:28:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622581424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:17,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:17,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:28:17,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506655474] [2025-02-08 08:28:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:17,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:28:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:17,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:28:17,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:28:17,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:17,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 386 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:17,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:17,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:17,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:17,711 INFO L124 PetriNetUnfolderBase]: 1124/1830 cut-off events. [2025-02-08 08:28:17,711 INFO L125 PetriNetUnfolderBase]: For 2196/2196 co-relation queries the response was YES. [2025-02-08 08:28:17,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 1830 events. 1124/1830 cut-off events. For 2196/2196 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8218 event pairs, 148 based on Foata normal form. 8/1838 useless extension candidates. Maximal degree in co-relation 5551. Up to 821 conditions per place. [2025-02-08 08:28:17,718 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 72 selfloop transitions, 19 changer transitions 39/136 dead transitions. [2025-02-08 08:28:17,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 136 transitions, 925 flow [2025-02-08 08:28:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:28:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 08:28:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 236 transitions. [2025-02-08 08:28:17,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39464882943143814 [2025-02-08 08:28:17,719 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 386 flow. Second operand 13 states and 236 transitions. [2025-02-08 08:28:17,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 136 transitions, 925 flow [2025-02-08 08:28:17,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 136 transitions, 871 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-02-08 08:28:17,724 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 443 flow [2025-02-08 08:28:17,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=443, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2025-02-08 08:28:17,725 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2025-02-08 08:28:17,725 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 443 flow [2025-02-08 08:28:17,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:17,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:17,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:17,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-08 08:28:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:17,926 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1720212945, now seen corresponding path program 19 times [2025-02-08 08:28:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:17,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097716468] [2025-02-08 08:28:17,926 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:28:17,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:17,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:17,929 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:17,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-08 08:28:17,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:17,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:17,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:17,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:17,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 08:28:17,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:18,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:18,213 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:18,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097716468] [2025-02-08 08:28:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097716468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:18,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:28:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037024180] [2025-02-08 08:28:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:18,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:28:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:18,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:28:18,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:28:18,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:18,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 443 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:18,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:18,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:18,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:18,556 INFO L124 PetriNetUnfolderBase]: 1066/1744 cut-off events. [2025-02-08 08:28:18,556 INFO L125 PetriNetUnfolderBase]: For 2424/2424 co-relation queries the response was YES. [2025-02-08 08:28:18,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 1744 events. 1066/1744 cut-off events. For 2424/2424 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7707 event pairs, 312 based on Foata normal form. 8/1752 useless extension candidates. Maximal degree in co-relation 5627. Up to 1233 conditions per place. [2025-02-08 08:28:18,562 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 60 selfloop transitions, 12 changer transitions 44/122 dead transitions. [2025-02-08 08:28:18,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 122 transitions, 886 flow [2025-02-08 08:28:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:28:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:28:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 211 transitions. [2025-02-08 08:28:18,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3822463768115942 [2025-02-08 08:28:18,563 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 443 flow. Second operand 12 states and 211 transitions. [2025-02-08 08:28:18,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 122 transitions, 886 flow [2025-02-08 08:28:18,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 770 flow, removed 21 selfloop flow, removed 14 redundant places. [2025-02-08 08:28:18,568 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 433 flow [2025-02-08 08:28:18,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=433, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2025-02-08 08:28:18,568 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2025-02-08 08:28:18,568 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 433 flow [2025-02-08 08:28:18,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:18,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:18,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:18,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-08 08:28:18,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:18,769 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 932221013, now seen corresponding path program 20 times [2025-02-08 08:28:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299487815] [2025-02-08 08:28:18,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:18,771 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:18,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-08 08:28:18,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:18,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:18,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:18,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:18,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 08:28:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:19,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:19,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:19,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299487815] [2025-02-08 08:28:19,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299487815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:19,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:28:19,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427025118] [2025-02-08 08:28:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:19,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:28:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:19,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:28:19,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:28:19,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:19,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 433 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:19,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:19,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:19,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:19,526 INFO L124 PetriNetUnfolderBase]: 866/1432 cut-off events. [2025-02-08 08:28:19,526 INFO L125 PetriNetUnfolderBase]: For 1930/1930 co-relation queries the response was YES. [2025-02-08 08:28:19,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 1432 events. 866/1432 cut-off events. For 1930/1930 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6031 event pairs, 78 based on Foata normal form. 8/1440 useless extension candidates. Maximal degree in co-relation 4607. Up to 396 conditions per place. [2025-02-08 08:28:19,532 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 61 selfloop transitions, 18 changer transitions 31/116 dead transitions. [2025-02-08 08:28:19,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 116 transitions, 790 flow [2025-02-08 08:28:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:28:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:28:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2025-02-08 08:28:19,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-02-08 08:28:19,533 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 433 flow. Second operand 12 states and 207 transitions. [2025-02-08 08:28:19,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 116 transitions, 790 flow [2025-02-08 08:28:19,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 116 transitions, 752 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-02-08 08:28:19,538 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 402 flow [2025-02-08 08:28:19,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=402, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2025-02-08 08:28:19,538 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2025-02-08 08:28:19,538 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 402 flow [2025-02-08 08:28:19,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:19,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:19,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:19,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-02-08 08:28:19,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:19,739 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1299433855, now seen corresponding path program 21 times [2025-02-08 08:28:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882475873] [2025-02-08 08:28:19,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:28:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:19,742 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:19,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-02-08 08:28:19,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:19,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:19,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:28:19,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:19,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 08:28:19,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:20,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:20,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882475873] [2025-02-08 08:28:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882475873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:28:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927368103] [2025-02-08 08:28:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:28:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:20,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:28:20,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:28:20,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:20,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 402 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:20,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:20,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:20,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:20,454 INFO L124 PetriNetUnfolderBase]: 936/1534 cut-off events. [2025-02-08 08:28:20,454 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2025-02-08 08:28:20,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5042 conditions, 1534 events. 936/1534 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6616 event pairs, 166 based on Foata normal form. 8/1542 useless extension candidates. Maximal degree in co-relation 5021. Up to 879 conditions per place. [2025-02-08 08:28:20,460 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 63 selfloop transitions, 14 changer transitions 37/120 dead transitions. [2025-02-08 08:28:20,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 120 transitions, 842 flow [2025-02-08 08:28:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:28:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:28:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2025-02-08 08:28:20,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38768115942028986 [2025-02-08 08:28:20,461 INFO L175 Difference]: Start difference. First operand has 88 places, 64 transitions, 402 flow. Second operand 12 states and 214 transitions. [2025-02-08 08:28:20,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 120 transitions, 842 flow [2025-02-08 08:28:20,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 120 transitions, 703 flow, removed 7 selfloop flow, removed 16 redundant places. [2025-02-08 08:28:20,465 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 380 flow [2025-02-08 08:28:20,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=380, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2025-02-08 08:28:20,465 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2025-02-08 08:28:20,465 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 380 flow [2025-02-08 08:28:20,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-02-08 08:28:20,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:20,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:20,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:20,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:20,666 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:20,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -598982433, now seen corresponding path program 22 times [2025-02-08 08:28:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832955011] [2025-02-08 08:28:20,667 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:28:20,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:20,670 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:20,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-02-08 08:28:20,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 08:28:20,734 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-02-08 08:28:20,734 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:28:20,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:20,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:28:20,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:21,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:21,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:28:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832955011] [2025-02-08 08:28:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832955011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:28:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568956232] [2025-02-08 08:28:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:28:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:21,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:21,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:28:21,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 380 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:21,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:21,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:28:21,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:21,592 INFO L124 PetriNetUnfolderBase]: 836/1390 cut-off events. [2025-02-08 08:28:21,592 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2025-02-08 08:28:21,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4373 conditions, 1390 events. 836/1390 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5880 event pairs, 148 based on Foata normal form. 8/1398 useless extension candidates. Maximal degree in co-relation 4353. Up to 932 conditions per place. [2025-02-08 08:28:21,597 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 57 selfloop transitions, 8 changer transitions 32/103 dead transitions. [2025-02-08 08:28:21,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 103 transitions, 713 flow [2025-02-08 08:28:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:28:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:28:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2025-02-08 08:28:21,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3652173913043478 [2025-02-08 08:28:21,598 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 380 flow. Second operand 10 states and 168 transitions. [2025-02-08 08:28:21,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 103 transitions, 713 flow [2025-02-08 08:28:21,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 643 flow, removed 22 selfloop flow, removed 10 redundant places. [2025-02-08 08:28:21,604 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 303 flow [2025-02-08 08:28:21,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=303, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2025-02-08 08:28:21,604 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-02-08 08:28:21,604 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 303 flow [2025-02-08 08:28:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-02-08 08:28:21,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:21,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:21,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-02-08 08:28:21,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:21,805 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:28:21,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1433552509, now seen corresponding path program 23 times [2025-02-08 08:28:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:28:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573661545] [2025-02-08 08:28:21,806 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:28:21,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:21,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:21,808 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:21,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-08 08:28:21,853 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:21,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:21,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:21,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:28:21,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:28:21,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:28:21,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:28:21,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:21,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:28:21,955 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:28:21,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:28:21,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:28:21,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:28:21,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:28:21,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:28:21,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:28:21,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:28:21,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:28:21,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:22,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:22,163 INFO L422 BasicCegarLoop]: Path program histogram: [23, 1, 1, 1, 1, 1] [2025-02-08 08:28:22,223 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:28:22,223 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:28:22,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:28:22 BasicIcfg [2025-02-08 08:28:22,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:28:22,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:28:22,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:28:22,228 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:28:22,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:55" (3/4) ... [2025-02-08 08:28:22,231 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:28:22,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:28:22,232 INFO L158 Benchmark]: Toolchain (without parser) took 27972.22ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 90.8MB in the beginning and 776.6MB in the end (delta: -685.8MB). Peak memory consumption was 300.4MB. Max. memory is 16.1GB. [2025-02-08 08:28:22,232 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:28:22,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.74ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 65.3MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:28:22,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.21ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 62.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:28:22,233 INFO L158 Benchmark]: Boogie Preprocessor took 38.92ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 59.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:28:22,234 INFO L158 Benchmark]: IcfgBuilder took 802.51ms. Allocated memory is still 117.4MB. Free memory was 59.0MB in the beginning and 64.0MB in the end (delta: -5.0MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-02-08 08:28:22,234 INFO L158 Benchmark]: TraceAbstraction took 26657.91ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 63.2MB in the beginning and 776.7MB in the end (delta: -713.5MB). Peak memory consumption was 268.0MB. Max. memory is 16.1GB. [2025-02-08 08:28:22,235 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 1.1GB. Free memory was 776.7MB in the beginning and 776.6MB in the end (delta: 107.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:28:22,236 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.20ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.74ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 65.3MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.21ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 62.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.92ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 59.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 802.51ms. Allocated memory is still 117.4MB. Free memory was 59.0MB in the beginning and 64.0MB in the end (delta: -5.0MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26657.91ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 63.2MB in the beginning and 776.7MB in the end (delta: -713.5MB). Peak memory consumption was 268.0MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 1.1GB. Free memory was 776.7MB in the beginning and 776.6MB in the end (delta: 107.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=8189, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=8189, t2538=8190, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=8189, t2538=8190, t2539=8191, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=8189, t2538=8190, t2539=8191, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=8189, t2538=8190, t2539=8191, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=8189, t2538=8190, t2539=8191, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 __assert_fail ("0", "safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 852]: 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: 850]: 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 7 procedures, 72 locations, 7 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: 26.5s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 23, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1688 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1644 mSDsluCounter, 864 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 834 mSDsCounter, 277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11876 IncrementalHoareTripleChecker+Invalid, 12153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 277 mSolverCounterUnsat, 30 mSDtfsCounter, 11876 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 866 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=23, InterpolantAutomatonStates: 254, 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.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 820 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 6679 SizeOfPredicates, 168 NumberOfNonLiveVariables, 3809 ConjunctsInSsa, 472 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 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-02-08 08:28:22,261 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample