./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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-?-8fc3dc6-m [2025-03-17 14:14:14,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:14:14,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:14:14,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:14:14,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:14:15,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:14:15,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:14:15,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:14:15,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:14:15,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:14:15,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:14:15,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:14:15,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:14:15,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:14:15,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:14:15,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:14:15,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:14:15,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:14:15,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:14:15,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:14:15,006 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:14:15,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:14:15,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:14:15,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:14:15,008 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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-03-17 14:14:15,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:14:15,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:14:15,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:14:15,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:14:15,263 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:14:15,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-17 14:14:16,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1eef538f/69a3b2be3ee1432fb6c5c2231202a3c5/FLAG7c901819c [2025-03-17 14:14:16,781 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:14:16,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-17 14:14:16,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1eef538f/69a3b2be3ee1432fb6c5c2231202a3c5/FLAG7c901819c [2025-03-17 14:14:16,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1eef538f/69a3b2be3ee1432fb6c5c2231202a3c5 [2025-03-17 14:14:16,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:14:16,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:14:16,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:14:16,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:14:16,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:14:16,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:14:16" (1/1) ... [2025-03-17 14:14:16,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c78adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:16, skipping insertion in model container [2025-03-17 14:14:16,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:14:16" (1/1) ... [2025-03-17 14:14:16,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:14:17,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:14:17,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:14:17,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:14:17,213 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:14:17,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17 WrapperNode [2025-03-17 14:14:17,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:14:17,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:14:17,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:14:17,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:14:17,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,265 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2025-03-17 14:14:17,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:14:17,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:14:17,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:14:17,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:14:17,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,291 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:14:17,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:14:17,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:14:17,311 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:14:17,311 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:14:17,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (1/1) ... [2025-03-17 14:14:17,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:14:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:17,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:14:17,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:14:17,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:14:17,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:14:17,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:14:17,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:14:17,372 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:14:17,485 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:14:17,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:14:17,900 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:14:17,900 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:14:18,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:14:18,188 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:14:18,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:18 BoogieIcfgContainer [2025-03-17 14:14:18,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:14:18,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:14:18,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:14:18,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:14:18,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:14:16" (1/3) ... [2025-03-17 14:14:18,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e30eb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:18, skipping insertion in model container [2025-03-17 14:14:18,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:17" (2/3) ... [2025-03-17 14:14:18,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e30eb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:18, skipping insertion in model container [2025-03-17 14:14:18,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:18" (3/3) ... [2025-03-17 14:14:18,199 INFO L128 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-17 14:14:18,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:14:18,212 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-03-17 14:14:18,212 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:14:18,255 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:14:18,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2025-03-17 14:14:18,312 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2025-03-17 14:14:18,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:18,318 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-03-17 14:14:18,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2025-03-17 14:14:18,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2025-03-17 14:14:18,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:14:18,336 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;@7094b3e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:14:18,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:14:18,341 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:14:18,341 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 14:14:18,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:18,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:18,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:18,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:14:18,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1526274788, now seen corresponding path program 1 times [2025-03-17 14:14:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791389726] [2025-03-17 14:14:18,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:18,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:14:18,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:14:18,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:18,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:18,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:18,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791389726] [2025-03-17 14:14:18,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791389726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:18,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:14:18,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607612638] [2025-03-17 14:14:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:18,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:14:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:18,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:14:18,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:14:18,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:14:18,781 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-03-17 14:14:18,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:18,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:14:18,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:20,028 INFO L124 PetriNetUnfolderBase]: 7377/10637 cut-off events. [2025-03-17 14:14:20,029 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:14:20,059 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-03-17 14:14:20,103 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-17 14:14:20,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-03-17 14:14:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:14:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:14:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-17 14:14:20,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2025-03-17 14:14:20,117 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 88 transitions. [2025-03-17 14:14:20,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-03-17 14:14:20,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:14:20,126 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2025-03-17 14:14:20,128 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-03-17 14:14:20,132 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-17 14:14:20,135 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2025-03-17 14:14:20,135 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-03-17 14:14:20,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:20,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:20,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:14:20,136 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-03-17 14:14:20,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1212809020, now seen corresponding path program 1 times [2025-03-17 14:14:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:20,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364715862] [2025-03-17 14:14:20,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:20,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:14:20,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:14:20,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:20,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:20,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364715862] [2025-03-17 14:14:20,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364715862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:20,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:20,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:14:20,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508659703] [2025-03-17 14:14:20,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:20,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:14:20,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:20,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:14:20,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:14:20,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:20,239 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-03-17 14:14:20,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:20,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:20,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:21,133 INFO L124 PetriNetUnfolderBase]: 6628/10280 cut-off events. [2025-03-17 14:14:21,134 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2025-03-17 14:14:21,153 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-03-17 14:14:21,193 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-03-17 14:14:21,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2025-03-17 14:14:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:14:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:14:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-17 14:14:21,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2025-03-17 14:14:21,195 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2025-03-17 14:14:21,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2025-03-17 14:14:21,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:14:21,200 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2025-03-17 14:14:21,200 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-03-17 14:14:21,201 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-03-17 14:14:21,201 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2025-03-17 14:14:21,201 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-03-17 14:14:21,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:21,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:21,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:14:21,202 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-03-17 14:14:21,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1212808090, now seen corresponding path program 1 times [2025-03-17 14:14:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:21,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212747232] [2025-03-17 14:14:21,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:21,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:21,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:14:21,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:14:21,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:21,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:21,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212747232] [2025-03-17 14:14:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212747232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:21,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:21,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:14:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209866015] [2025-03-17 14:14:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:21,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:14:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:21,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:14:21,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:14:21,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:21,738 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-03-17 14:14:21,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:21,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:21,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:23,623 INFO L124 PetriNetUnfolderBase]: 9820/14515 cut-off events. [2025-03-17 14:14:23,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:23,637 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-03-17 14:14:23,659 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 55 selfloop transitions, 11 changer transitions 117/188 dead transitions. [2025-03-17 14:14:23,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 188 transitions, 754 flow [2025-03-17 14:14:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:14:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:14:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 294 transitions. [2025-03-17 14:14:23,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2025-03-17 14:14:23,662 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 12 states and 294 transitions. [2025-03-17 14:14:23,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 188 transitions, 754 flow [2025-03-17 14:14:23,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 188 transitions, 753 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:14:23,667 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 189 flow [2025-03-17 14:14:23,667 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-03-17 14:14:23,668 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-03-17 14:14:23,668 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 189 flow [2025-03-17 14:14:23,668 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-03-17 14:14:23,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:23,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:23,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:14:23,669 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-03-17 14:14:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1158576913, now seen corresponding path program 1 times [2025-03-17 14:14:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422127701] [2025-03-17 14:14:23,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:23,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:14:23,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:14:23,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:23,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422127701] [2025-03-17 14:14:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422127701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:23,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:23,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:14:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167517805] [2025-03-17 14:14:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:23,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:23,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:23,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:23,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:23,851 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-03-17 14:14:23,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:23,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:23,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:24,738 INFO L124 PetriNetUnfolderBase]: 6992/10387 cut-off events. [2025-03-17 14:14:24,739 INFO L125 PetriNetUnfolderBase]: For 16129/16129 co-relation queries the response was YES. [2025-03-17 14:14:24,766 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-03-17 14:14:24,840 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 59 selfloop transitions, 3 changer transitions 73/140 dead transitions. [2025-03-17 14:14:24,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 140 transitions, 885 flow [2025-03-17 14:14:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:14:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:14:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-03-17 14:14:24,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.531055900621118 [2025-03-17 14:14:24,842 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 189 flow. Second operand 7 states and 171 transitions. [2025-03-17 14:14:24,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 140 transitions, 885 flow [2025-03-17 14:14:24,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 140 transitions, 827 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-03-17 14:14:24,924 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 190 flow [2025-03-17 14:14:24,924 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-03-17 14:14:24,926 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2025-03-17 14:14:24,926 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 190 flow [2025-03-17 14:14:24,926 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-03-17 14:14:24,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:24,926 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-03-17 14:14:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:14:24,927 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-03-17 14:14:24,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -454386161, now seen corresponding path program 1 times [2025-03-17 14:14:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55300254] [2025-03-17 14:14:24,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:24,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:14:24,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:14:24,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:24,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:25,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55300254] [2025-03-17 14:14:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55300254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:14:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093447417] [2025-03-17 14:14:25,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:14:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:25,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:14:25,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:14:25,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:25,554 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-03-17 14:14:25,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:25,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:25,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:26,637 INFO L124 PetriNetUnfolderBase]: 6269/9217 cut-off events. [2025-03-17 14:14:26,638 INFO L125 PetriNetUnfolderBase]: For 12061/12061 co-relation queries the response was YES. [2025-03-17 14:14:26,652 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-03-17 14:14:26,674 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 67 selfloop transitions, 8 changer transitions 51/131 dead transitions. [2025-03-17 14:14:26,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 131 transitions, 789 flow [2025-03-17 14:14:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:14:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:14:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-03-17 14:14:26,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5027173913043478 [2025-03-17 14:14:26,675 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 190 flow. Second operand 8 states and 185 transitions. [2025-03-17 14:14:26,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 131 transitions, 789 flow [2025-03-17 14:14:26,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 757 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-17 14:14:26,722 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 258 flow [2025-03-17 14:14:26,723 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-03-17 14:14:26,723 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-03-17 14:14:26,723 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 258 flow [2025-03-17 14:14:26,723 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-03-17 14:14:26,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:26,724 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-03-17 14:14:26,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:14:26,724 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-03-17 14:14:26,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:26,724 INFO L85 PathProgramCache]: Analyzing trace with hash -47585245, now seen corresponding path program 2 times [2025-03-17 14:14:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667458604] [2025-03-17 14:14:26,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:26,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:14:26,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:14:26,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:26,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667458604] [2025-03-17 14:14:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667458604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:14:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584456546] [2025-03-17 14:14:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:27,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:14:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:27,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:14:27,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:14:27,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:27,735 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-03-17 14:14:27,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:27,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:27,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:29,329 INFO L124 PetriNetUnfolderBase]: 11631/17098 cut-off events. [2025-03-17 14:14:29,330 INFO L125 PetriNetUnfolderBase]: For 25450/25452 co-relation queries the response was YES. [2025-03-17 14:14:29,386 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-03-17 14:14:29,415 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 90 selfloop transitions, 17 changer transitions 103/215 dead transitions. [2025-03-17 14:14:29,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 215 transitions, 1433 flow [2025-03-17 14:14:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:14:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:14:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-03-17 14:14:29,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525691699604743 [2025-03-17 14:14:29,416 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 258 flow. Second operand 11 states and 266 transitions. [2025-03-17 14:14:29,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 215 transitions, 1433 flow [2025-03-17 14:14:29,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 215 transitions, 1373 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-03-17 14:14:29,598 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 419 flow [2025-03-17 14:14:29,598 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-03-17 14:14:29,598 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2025-03-17 14:14:29,598 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 419 flow [2025-03-17 14:14:29,598 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-03-17 14:14:29,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:29,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:29,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:14:29,599 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-03-17 14:14:29,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2144934554, now seen corresponding path program 1 times [2025-03-17 14:14:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-03-17 14:14:29,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:29,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:29,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:29,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:29,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-03-17 14:14:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295332620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:30,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:30,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:14:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103000913] [2025-03-17 14:14:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:30,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:14:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:30,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:14:30,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:14:30,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:30,195 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-03-17 14:14:30,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:30,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:30,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:31,980 INFO L124 PetriNetUnfolderBase]: 12400/18196 cut-off events. [2025-03-17 14:14:31,981 INFO L125 PetriNetUnfolderBase]: For 35906/35906 co-relation queries the response was YES. [2025-03-17 14:14:32,041 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-03-17 14:14:32,076 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 149 selfloop transitions, 32 changer transitions 88/274 dead transitions. [2025-03-17 14:14:32,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 274 transitions, 2108 flow [2025-03-17 14:14:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:14:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 14:14:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 359 transitions. [2025-03-17 14:14:32,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45907928388746805 [2025-03-17 14:14:32,079 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 419 flow. Second operand 17 states and 359 transitions. [2025-03-17 14:14:32,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 274 transitions, 2108 flow [2025-03-17 14:14:32,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 274 transitions, 2059 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-17 14:14:32,335 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 803 flow [2025-03-17 14:14:32,336 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-03-17 14:14:32,336 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2025-03-17 14:14:32,336 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 803 flow [2025-03-17 14:14:32,336 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-03-17 14:14:32,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:32,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:32,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:14:32,337 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-03-17 14:14:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1967018655, now seen corresponding path program 1 times [2025-03-17 14:14:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374624194] [2025-03-17 14:14:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:32,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:32,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:32,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:32,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374624194] [2025-03-17 14:14:32,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374624194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:32,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:32,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:14:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678806476] [2025-03-17 14:14:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:32,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:32,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:32,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:32,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:32,507 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-03-17 14:14:32,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:32,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:32,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:34,792 INFO L124 PetriNetUnfolderBase]: 13618/20076 cut-off events. [2025-03-17 14:14:34,792 INFO L125 PetriNetUnfolderBase]: For 83251/83251 co-relation queries the response was YES. [2025-03-17 14:14:34,919 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-03-17 14:14:34,957 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 89 selfloop transitions, 4 changer transitions 66/164 dead transitions. [2025-03-17 14:14:34,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 164 transitions, 1701 flow [2025-03-17 14:14:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:14:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:14:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-03-17 14:14:34,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5062111801242236 [2025-03-17 14:14:34,959 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 803 flow. Second operand 7 states and 163 transitions. [2025-03-17 14:14:34,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 164 transitions, 1701 flow [2025-03-17 14:14:35,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 164 transitions, 1611 flow, removed 43 selfloop flow, removed 7 redundant places. [2025-03-17 14:14:35,265 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 620 flow [2025-03-17 14:14:35,265 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-03-17 14:14:35,266 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2025-03-17 14:14:35,266 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 620 flow [2025-03-17 14:14:35,266 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-03-17 14:14:35,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:35,266 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-03-17 14:14:35,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:14:35,266 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-03-17 14:14:35,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1766287268, now seen corresponding path program 1 times [2025-03-17 14:14:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129968247] [2025-03-17 14:14:35,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:35,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:35,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:14:35,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:14:35,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:35,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14: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-03-17 14:14:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129968247] [2025-03-17 14:14:35,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129968247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:35,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:35,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:14:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276187896] [2025-03-17 14:14:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:35,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:14:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:35,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:14:35,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:14:35,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:35,890 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-03-17 14:14:35,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:35,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:35,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:37,377 INFO L124 PetriNetUnfolderBase]: 11880/17774 cut-off events. [2025-03-17 14:14:37,377 INFO L125 PetriNetUnfolderBase]: For 72740/72740 co-relation queries the response was YES. [2025-03-17 14:14:37,500 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-03-17 14:14:37,543 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 81 selfloop transitions, 12 changer transitions 40/138 dead transitions. [2025-03-17 14:14:37,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 138 transitions, 1184 flow [2025-03-17 14:14:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:14:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:14:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-03-17 14:14:37,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4592391304347826 [2025-03-17 14:14:37,548 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 620 flow. Second operand 8 states and 169 transitions. [2025-03-17 14:14:37,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 138 transitions, 1184 flow [2025-03-17 14:14:37,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 138 transitions, 1162 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-17 14:14:37,798 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 706 flow [2025-03-17 14:14:37,798 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-03-17 14:14:37,799 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2025-03-17 14:14:37,799 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 706 flow [2025-03-17 14:14:37,799 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-03-17 14:14:37,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:37,799 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-03-17 14:14:37,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:14:37,799 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-03-17 14:14:37,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1359510596, now seen corresponding path program 1 times [2025-03-17 14:14:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:37,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-03-17 14:14:37,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:37,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:14:37,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:14:37,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-03-17 14:14:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382040879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:38,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:14:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974142392] [2025-03-17 14:14:38,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:38,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:14:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:38,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:14:38,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:14:38,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:38,252 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-03-17 14:14:38,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:38,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:38,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:40,383 INFO L124 PetriNetUnfolderBase]: 15582/23195 cut-off events. [2025-03-17 14:14:40,383 INFO L125 PetriNetUnfolderBase]: For 103527/103527 co-relation queries the response was YES. [2025-03-17 14:14:40,548 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-03-17 14:14:40,592 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 133 selfloop transitions, 58 changer transitions 61/257 dead transitions. [2025-03-17 14:14:40,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 257 transitions, 2666 flow [2025-03-17 14:14:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:14:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:14:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 252 transitions. [2025-03-17 14:14:40,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4980237154150198 [2025-03-17 14:14:40,595 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 706 flow. Second operand 11 states and 252 transitions. [2025-03-17 14:14:40,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 257 transitions, 2666 flow [2025-03-17 14:14:40,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 257 transitions, 2626 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-17 14:14:40,945 INFO L231 Difference]: Finished difference. Result has 100 places, 125 transitions, 1578 flow [2025-03-17 14:14:40,946 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-03-17 14:14:40,946 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2025-03-17 14:14:40,946 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 125 transitions, 1578 flow [2025-03-17 14:14:40,946 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-03-17 14:14:40,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:40,947 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-03-17 14:14:40,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:14:40,947 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-03-17 14:14:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -782292920, now seen corresponding path program 2 times [2025-03-17 14:14:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:40,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751013763] [2025-03-17 14:14:40,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:40,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:14:40,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:14:40,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:40,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751013763] [2025-03-17 14:14:42,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751013763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:42,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:42,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:14:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748296231] [2025-03-17 14:14:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:42,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:14:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:42,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:14:42,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:14:42,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:42,008 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-03-17 14:14:42,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:42,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:42,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:45,081 INFO L124 PetriNetUnfolderBase]: 17393/26027 cut-off events. [2025-03-17 14:14:45,081 INFO L125 PetriNetUnfolderBase]: For 166808/166808 co-relation queries the response was YES. [2025-03-17 14:14:45,241 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-03-17 14:14:45,286 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 187 selfloop transitions, 50 changer transitions 101/343 dead transitions. [2025-03-17 14:14:45,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 343 transitions, 3904 flow [2025-03-17 14:14:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:14:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 14:14:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 363 transitions. [2025-03-17 14:14:45,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4641943734015345 [2025-03-17 14:14:45,290 INFO L175 Difference]: Start difference. First operand has 100 places, 125 transitions, 1578 flow. Second operand 17 states and 363 transitions. [2025-03-17 14:14:45,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 343 transitions, 3904 flow [2025-03-17 14:14:45,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 343 transitions, 3669 flow, removed 117 selfloop flow, removed 3 redundant places. [2025-03-17 14:14:45,869 INFO L231 Difference]: Finished difference. Result has 123 places, 152 transitions, 2056 flow [2025-03-17 14:14:45,869 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-03-17 14:14:45,870 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2025-03-17 14:14:45,870 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 152 transitions, 2056 flow [2025-03-17 14:14:45,870 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-03-17 14:14:45,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:45,870 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-03-17 14:14:45,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:14:45,870 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-03-17 14:14:45,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1820360980, now seen corresponding path program 3 times [2025-03-17 14:14:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582331430] [2025-03-17 14:14:45,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:14:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:45,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:14:45,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:14:45,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:14:45,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:46,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582331430] [2025-03-17 14:14:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582331430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:46,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:14:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718582905] [2025-03-17 14:14:46,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:14:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:46,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:14:46,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:14:46,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:46,621 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-03-17 14:14:46,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:46,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:49,635 INFO L124 PetriNetUnfolderBase]: 16439/24855 cut-off events. [2025-03-17 14:14:49,635 INFO L125 PetriNetUnfolderBase]: For 172487/172487 co-relation queries the response was YES. [2025-03-17 14:14:49,843 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-03-17 14:14:49,887 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 196 selfloop transitions, 95 changer transitions 56/352 dead transitions. [2025-03-17 14:14:49,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 352 transitions, 4386 flow [2025-03-17 14:14:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:14:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 14:14:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 350 transitions. [2025-03-17 14:14:49,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4475703324808184 [2025-03-17 14:14:49,888 INFO L175 Difference]: Start difference. First operand has 123 places, 152 transitions, 2056 flow. Second operand 17 states and 350 transitions. [2025-03-17 14:14:49,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 352 transitions, 4386 flow [2025-03-17 14:14:50,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 352 transitions, 4268 flow, removed 34 selfloop flow, removed 9 redundant places. [2025-03-17 14:14:50,378 INFO L231 Difference]: Finished difference. Result has 130 places, 190 transitions, 2939 flow [2025-03-17 14:14:50,379 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-03-17 14:14:50,379 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 79 predicate places. [2025-03-17 14:14:50,379 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 190 transitions, 2939 flow [2025-03-17 14:14:50,380 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-03-17 14:14:50,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:50,380 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-03-17 14:14:50,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:14:50,380 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-03-17 14:14:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 368786492, now seen corresponding path program 4 times [2025-03-17 14:14:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484780635] [2025-03-17 14:14:50,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:14:50,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:50,390 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-17 14:14:50,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:14:50,425 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:14:50,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484780635] [2025-03-17 14:14:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484780635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:14:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433009802] [2025-03-17 14:14:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:14:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:50,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:14:50,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:14:50,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:14:50,520 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-03-17 14:14:50,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:50,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:14:50,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:53,408 INFO L124 PetriNetUnfolderBase]: 13598/21017 cut-off events. [2025-03-17 14:14:53,409 INFO L125 PetriNetUnfolderBase]: For 193830/193830 co-relation queries the response was YES. [2025-03-17 14:14:53,597 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-03-17 14:14:53,654 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 181 selfloop transitions, 5 changer transitions 33/224 dead transitions. [2025-03-17 14:14:53,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 224 transitions, 3738 flow [2025-03-17 14:14:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:14:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:14:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-03-17 14:14:53,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5815217391304348 [2025-03-17 14:14:53,656 INFO L175 Difference]: Start difference. First operand has 130 places, 190 transitions, 2939 flow. Second operand 4 states and 107 transitions. [2025-03-17 14:14:53,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 224 transitions, 3738 flow [2025-03-17 14:14:54,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 224 transitions, 3547 flow, removed 70 selfloop flow, removed 12 redundant places. [2025-03-17 14:14:54,160 INFO L231 Difference]: Finished difference. Result has 118 places, 121 transitions, 1645 flow [2025-03-17 14:14:54,161 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-03-17 14:14:54,161 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2025-03-17 14:14:54,161 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 121 transitions, 1645 flow [2025-03-17 14:14:54,161 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-03-17 14:14:54,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:54,161 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-03-17 14:14:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:14:54,162 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-03-17 14:14:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1378127354, now seen corresponding path program 1 times [2025-03-17 14:14:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630736858] [2025-03-17 14:14:54,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:54,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:14:54,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:14:54,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630736858] [2025-03-17 14:14:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630736858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:54,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:14:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398924177] [2025-03-17 14:14:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:54,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:54,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:54,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:54,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:54,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:14:54,422 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-03-17 14:14:54,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:54,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:14:54,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:55,555 INFO L124 PetriNetUnfolderBase]: 8493/13291 cut-off events. [2025-03-17 14:14:55,555 INFO L125 PetriNetUnfolderBase]: For 107189/107189 co-relation queries the response was YES. [2025-03-17 14:14:55,623 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-03-17 14:14:55,645 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 150 selfloop transitions, 8 changer transitions 31/194 dead transitions. [2025-03-17 14:14:55,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 3003 flow [2025-03-17 14:14:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:14:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:14:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-17 14:14:55,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5695652173913044 [2025-03-17 14:14:55,646 INFO L175 Difference]: Start difference. First operand has 118 places, 121 transitions, 1645 flow. Second operand 5 states and 131 transitions. [2025-03-17 14:14:55,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 3003 flow [2025-03-17 14:14:55,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 194 transitions, 2848 flow, removed 20 selfloop flow, removed 13 redundant places. [2025-03-17 14:14:55,783 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 1260 flow [2025-03-17 14:14:55,784 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-03-17 14:14:55,784 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 59 predicate places. [2025-03-17 14:14:55,784 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 1260 flow [2025-03-17 14:14:55,784 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-03-17 14:14:55,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:55,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:55,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:14:55,784 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-03-17 14:14:55,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1219922653, now seen corresponding path program 1 times [2025-03-17 14:14:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:55,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604487735] [2025-03-17 14:14:55,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:55,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:14:55,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:14:55,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:55,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604487735] [2025-03-17 14:14:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604487735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:55,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:14:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574391278] [2025-03-17 14:14:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:55,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:14:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:55,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:14:55,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:14:55,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:14:55,931 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-03-17 14:14:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:14:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:56,645 INFO L124 PetriNetUnfolderBase]: 5402/8410 cut-off events. [2025-03-17 14:14:56,645 INFO L125 PetriNetUnfolderBase]: For 68590/68590 co-relation queries the response was YES. [2025-03-17 14:14:56,681 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-03-17 14:14:56,694 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 113 selfloop transitions, 11 changer transitions 46/175 dead transitions. [2025-03-17 14:14:56,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 175 transitions, 2545 flow [2025-03-17 14:14:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:14:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:14:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-17 14:14:56,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2025-03-17 14:14:56,695 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 1260 flow. Second operand 6 states and 133 transitions. [2025-03-17 14:14:56,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 175 transitions, 2545 flow [2025-03-17 14:14:56,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 175 transitions, 2401 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-03-17 14:14:56,862 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 947 flow [2025-03-17 14:14:56,862 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-03-17 14:14:56,862 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2025-03-17 14:14:56,863 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 947 flow [2025-03-17 14:14:56,863 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-03-17 14:14:56,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:56,863 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-03-17 14:14:56,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:14:56,863 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-03-17 14:14:56,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1209315629, now seen corresponding path program 1 times [2025-03-17 14:14:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380099342] [2025-03-17 14:14:56,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:56,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:14:56,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:14:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380099342] [2025-03-17 14:14:57,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380099342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:14:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010586110] [2025-03-17 14:14:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:14:57,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:57,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:14:57,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:14:57,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:57,233 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-03-17 14:14:57,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:57,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:57,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:57,657 INFO L124 PetriNetUnfolderBase]: 2119/3320 cut-off events. [2025-03-17 14:14:57,657 INFO L125 PetriNetUnfolderBase]: For 22411/22411 co-relation queries the response was YES. [2025-03-17 14:14:57,669 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-03-17 14:14:57,676 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 71 selfloop transitions, 26 changer transitions 26/128 dead transitions. [2025-03-17 14:14:57,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 1520 flow [2025-03-17 14:14:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:14:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:14:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-03-17 14:14:57,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39945652173913043 [2025-03-17 14:14:57,677 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 947 flow. Second operand 8 states and 147 transitions. [2025-03-17 14:14:57,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 1520 flow [2025-03-17 14:14:57,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 128 transitions, 1245 flow, removed 85 selfloop flow, removed 19 redundant places. [2025-03-17 14:14:57,719 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 868 flow [2025-03-17 14:14:57,719 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-03-17 14:14:57,720 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2025-03-17 14:14:57,720 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 868 flow [2025-03-17 14:14:57,720 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-03-17 14:14:57,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:57,720 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-03-17 14:14:57,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:14:57,720 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-03-17 14:14:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash -421845471, now seen corresponding path program 2 times [2025-03-17 14:14:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587825992] [2025-03-17 14:14:57,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:57,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:14:57,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:14:57,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:57,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587825992] [2025-03-17 14:14:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587825992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:58,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:14:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331239503] [2025-03-17 14:14:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:58,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:14:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:58,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:14:58,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:14:58,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:58,081 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-03-17 14:14:58,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:58,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:58,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:58,619 INFO L124 PetriNetUnfolderBase]: 2432/3831 cut-off events. [2025-03-17 14:14:58,619 INFO L125 PetriNetUnfolderBase]: For 15053/15053 co-relation queries the response was YES. [2025-03-17 14:14:58,632 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-03-17 14:14:58,638 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 79 selfloop transitions, 18 changer transitions 35/137 dead transitions. [2025-03-17 14:14:58,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 1401 flow [2025-03-17 14:14:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:14:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:14:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-17 14:14:58,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4048913043478261 [2025-03-17 14:14:58,639 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 868 flow. Second operand 8 states and 149 transitions. [2025-03-17 14:14:58,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 1401 flow [2025-03-17 14:14:58,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 1327 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-17 14:14:58,653 INFO L231 Difference]: Finished difference. Result has 101 places, 78 transitions, 824 flow [2025-03-17 14:14:58,653 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-03-17 14:14:58,654 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2025-03-17 14:14:58,654 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 78 transitions, 824 flow [2025-03-17 14:14:58,654 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-03-17 14:14:58,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:58,654 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-03-17 14:14:58,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:14:58,654 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-03-17 14:14:58,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1499250181, now seen corresponding path program 3 times [2025-03-17 14:14:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421658507] [2025-03-17 14:14:58,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:14:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:58,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:14:58,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:14:58,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:14:58,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421658507] [2025-03-17 14:14:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421658507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:59,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:14:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531935956] [2025-03-17 14:14:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:59,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:14:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:59,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:14:59,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:14:59,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:14:59,283 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-03-17 14:14:59,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:59,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:14:59,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:59,921 INFO L124 PetriNetUnfolderBase]: 2901/4587 cut-off events. [2025-03-17 14:14:59,921 INFO L125 PetriNetUnfolderBase]: For 16644/16644 co-relation queries the response was YES. [2025-03-17 14:14:59,938 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-03-17 14:14:59,948 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 119 selfloop transitions, 24 changer transitions 34/182 dead transitions. [2025-03-17 14:14:59,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 182 transitions, 1734 flow [2025-03-17 14:14:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:14:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:14:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 238 transitions. [2025-03-17 14:14:59,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3979933110367893 [2025-03-17 14:14:59,955 INFO L175 Difference]: Start difference. First operand has 101 places, 78 transitions, 824 flow. Second operand 13 states and 238 transitions. [2025-03-17 14:14:59,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 182 transitions, 1734 flow [2025-03-17 14:14:59,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 182 transitions, 1586 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-03-17 14:14:59,989 INFO L231 Difference]: Finished difference. Result has 103 places, 78 transitions, 784 flow [2025-03-17 14:14:59,989 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-03-17 14:14:59,990 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2025-03-17 14:14:59,990 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 78 transitions, 784 flow [2025-03-17 14:14:59,990 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-03-17 14:14:59,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:59,990 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-03-17 14:14:59,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:14:59,990 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-03-17 14:14:59,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1752175595, now seen corresponding path program 4 times [2025-03-17 14:14:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095077563] [2025-03-17 14:14:59,991 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:14:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:59,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:15:00,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:00,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:15:00,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:15:00,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095077563] [2025-03-17 14:15:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095077563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:00,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:15:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240293658] [2025-03-17 14:15:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:00,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:15:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:15:00,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:15:00,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:15:00,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:00,821 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-03-17 14:15:00,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:00,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:00,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:01,270 INFO L124 PetriNetUnfolderBase]: 2367/3769 cut-off events. [2025-03-17 14:15:01,270 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2025-03-17 14:15:01,282 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-03-17 14:15:01,287 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 72 selfloop transitions, 18 changer transitions 14/109 dead transitions. [2025-03-17 14:15:01,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 1088 flow [2025-03-17 14:15:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:15:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:15:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-17 14:15:01,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2025-03-17 14:15:01,288 INFO L175 Difference]: Start difference. First operand has 103 places, 78 transitions, 784 flow. Second operand 8 states and 144 transitions. [2025-03-17 14:15:01,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 1088 flow [2025-03-17 14:15:01,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 1013 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-03-17 14:15:01,299 INFO L231 Difference]: Finished difference. Result has 102 places, 77 transitions, 765 flow [2025-03-17 14:15:01,299 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-03-17 14:15:01,300 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 51 predicate places. [2025-03-17 14:15:01,300 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 77 transitions, 765 flow [2025-03-17 14:15:01,300 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-03-17 14:15:01,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:01,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:15:01,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:15:01,300 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-03-17 14:15:01,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash -645207621, now seen corresponding path program 5 times [2025-03-17 14:15:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:15:01,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093674461] [2025-03-17 14:15:01,300 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:15:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:15:01,307 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:01,336 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:01,336 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:01,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:02,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:15:02,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093674461] [2025-03-17 14:15:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093674461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:15:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276867985] [2025-03-17 14:15:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:02,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:15:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:15:02,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:15:02,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:15:02,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:15:02,400 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-03-17 14:15:02,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:02,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:15:02,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:03,092 INFO L124 PetriNetUnfolderBase]: 3316/5244 cut-off events. [2025-03-17 14:15:03,092 INFO L125 PetriNetUnfolderBase]: For 15486/15486 co-relation queries the response was YES. [2025-03-17 14:15:03,108 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-03-17 14:15:03,115 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 103 selfloop transitions, 19 changer transitions 59/186 dead transitions. [2025-03-17 14:15:03,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 186 transitions, 1611 flow [2025-03-17 14:15:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-03-17 14:15:03,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2025-03-17 14:15:03,116 INFO L175 Difference]: Start difference. First operand has 102 places, 77 transitions, 765 flow. Second operand 11 states and 220 transitions. [2025-03-17 14:15:03,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 186 transitions, 1611 flow [2025-03-17 14:15:03,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 186 transitions, 1548 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-17 14:15:03,128 INFO L231 Difference]: Finished difference. Result has 109 places, 74 transitions, 740 flow [2025-03-17 14:15:03,128 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-03-17 14:15:03,129 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 58 predicate places. [2025-03-17 14:15:03,129 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 74 transitions, 740 flow [2025-03-17 14:15:03,129 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-03-17 14:15:03,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:03,129 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-03-17 14:15:03,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:15:03,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-03-17 14:15:03,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1801404699, now seen corresponding path program 6 times [2025-03-17 14:15:03,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:15:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028551908] [2025-03-17 14:15:03,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:15:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:15:03,137 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:03,148 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:03,149 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:15:03,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:03,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-03-17 14:15:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:15:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028551908] [2025-03-17 14:15:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028551908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:03,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:03,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:15:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126171113] [2025-03-17 14:15:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:03,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:15:03,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:03,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:03,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:15:03,498 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-03-17 14:15:03,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:03,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:15:03,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:03,997 INFO L124 PetriNetUnfolderBase]: 2124/3372 cut-off events. [2025-03-17 14:15:03,997 INFO L125 PetriNetUnfolderBase]: For 12602/12602 co-relation queries the response was YES. [2025-03-17 14:15:04,007 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-03-17 14:15:04,011 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 62 selfloop transitions, 7 changer transitions 46/120 dead transitions. [2025-03-17 14:15:04,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 120 transitions, 1139 flow [2025-03-17 14:15:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2025-03-17 14:15:04,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2025-03-17 14:15:04,012 INFO L175 Difference]: Start difference. First operand has 109 places, 74 transitions, 740 flow. Second operand 10 states and 170 transitions. [2025-03-17 14:15:04,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 120 transitions, 1139 flow [2025-03-17 14:15:04,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 1025 flow, removed 23 selfloop flow, removed 13 redundant places. [2025-03-17 14:15:04,026 INFO L231 Difference]: Finished difference. Result has 104 places, 66 transitions, 566 flow [2025-03-17 14:15:04,026 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-03-17 14:15:04,026 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2025-03-17 14:15:04,026 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 66 transitions, 566 flow [2025-03-17 14:15:04,026 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-03-17 14:15:04,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:04,026 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-03-17 14:15:04,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:15:04,026 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-03-17 14:15:04,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 908027171, now seen corresponding path program 7 times [2025-03-17 14:15:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:15:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686042935] [2025-03-17 14:15:04,027 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:15:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:15:04,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:04,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:04,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:04,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:15:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686042935] [2025-03-17 14:15:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686042935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:04,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:04,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:15:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106042553] [2025-03-17 14:15:04,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:04,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:15:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:15:04,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:15:04,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:15:04,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:15:04,536 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-03-17 14:15:04,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:04,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:15:04,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:05,112 INFO L124 PetriNetUnfolderBase]: 2538/4052 cut-off events. [2025-03-17 14:15:05,112 INFO L125 PetriNetUnfolderBase]: For 9562/9562 co-relation queries the response was YES. [2025-03-17 14:15:05,125 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-03-17 14:15:05,131 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 99 selfloop transitions, 22 changer transitions 39/165 dead transitions. [2025-03-17 14:15:05,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 165 transitions, 1351 flow [2025-03-17 14:15:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:15:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:15:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2025-03-17 14:15:05,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4076086956521739 [2025-03-17 14:15:05,132 INFO L175 Difference]: Start difference. First operand has 104 places, 66 transitions, 566 flow. Second operand 12 states and 225 transitions. [2025-03-17 14:15:05,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 165 transitions, 1351 flow [2025-03-17 14:15:05,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 165 transitions, 1267 flow, removed 24 selfloop flow, removed 12 redundant places. [2025-03-17 14:15:05,146 INFO L231 Difference]: Finished difference. Result has 95 places, 67 transitions, 586 flow [2025-03-17 14:15:05,146 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-03-17 14:15:05,146 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2025-03-17 14:15:05,147 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 67 transitions, 586 flow [2025-03-17 14:15:05,147 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-03-17 14:15:05,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:05,147 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-03-17 14:15:05,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:15:05,147 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-03-17 14:15:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1285843537, now seen corresponding path program 8 times [2025-03-17 14:15:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:15:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790427590] [2025-03-17 14:15:05,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:15:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:15:05,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:05,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:05,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:05,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:15:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790427590] [2025-03-17 14:15:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790427590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 14:15:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138022109] [2025-03-17 14:15:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:15:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:15:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:15:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:15:06,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:15:06,634 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-03-17 14:15:06,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:06,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:15:06,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:07,191 INFO L124 PetriNetUnfolderBase]: 2497/4009 cut-off events. [2025-03-17 14:15:07,192 INFO L125 PetriNetUnfolderBase]: For 8548/8548 co-relation queries the response was YES. [2025-03-17 14:15:07,202 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-03-17 14:15:07,207 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 80 selfloop transitions, 10 changer transitions 46/141 dead transitions. [2025-03-17 14:15:07,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 141 transitions, 1156 flow [2025-03-17 14:15:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-03-17 14:15:07,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39723320158102765 [2025-03-17 14:15:07,208 INFO L175 Difference]: Start difference. First operand has 95 places, 67 transitions, 586 flow. Second operand 11 states and 201 transitions. [2025-03-17 14:15:07,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 141 transitions, 1156 flow [2025-03-17 14:15:07,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 141 transitions, 1093 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-03-17 14:15:07,218 INFO L231 Difference]: Finished difference. Result has 99 places, 54 transitions, 409 flow [2025-03-17 14:15:07,219 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-03-17 14:15:07,220 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2025-03-17 14:15:07,220 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 54 transitions, 409 flow [2025-03-17 14:15:07,220 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-03-17 14:15:07,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:07,220 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-03-17 14:15:07,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:15:07,221 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-03-17 14:15:07,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 332644055, now seen corresponding path program 9 times [2025-03-17 14:15:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:15:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940539505] [2025-03-17 14:15:07,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:15:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:15:07,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:07,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:07,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:15:07,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:15:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940539505] [2025-03-17 14:15:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940539505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:15:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546596761] [2025-03-17 14:15:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:15:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:15:07,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:15:07,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:15:07,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:15:07,523 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-03-17 14:15:07,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:07,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:15:07,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:07,825 INFO L124 PetriNetUnfolderBase]: 1075/1739 cut-off events. [2025-03-17 14:15:07,825 INFO L125 PetriNetUnfolderBase]: For 4496/4496 co-relation queries the response was YES. [2025-03-17 14:15:07,829 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-03-17 14:15:07,831 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 42 selfloop transitions, 4 changer transitions 35/86 dead transitions. [2025-03-17 14:15:07,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 86 transitions, 681 flow [2025-03-17 14:15:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:15:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:15:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-03-17 14:15:07,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39751552795031053 [2025-03-17 14:15:07,832 INFO L175 Difference]: Start difference. First operand has 99 places, 54 transitions, 409 flow. Second operand 7 states and 128 transitions. [2025-03-17 14:15:07,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 86 transitions, 681 flow [2025-03-17 14:15:07,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 86 transitions, 574 flow, removed 18 selfloop flow, removed 18 redundant places. [2025-03-17 14:15:07,836 INFO L231 Difference]: Finished difference. Result has 86 places, 49 transitions, 274 flow [2025-03-17 14:15:07,836 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-03-17 14:15:07,837 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2025-03-17 14:15:07,837 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 49 transitions, 274 flow [2025-03-17 14:15:07,837 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-03-17 14:15:07,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:07,837 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-03-17 14:15:07,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 14:15:07,837 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-03-17 14:15:07,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash 546461827, now seen corresponding path program 10 times [2025-03-17 14:15:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:15:07,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745597727] [2025-03-17 14:15:07,837 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:15:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:15:07,843 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:15:07,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:07,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:15:07,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:15:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745597727] [2025-03-17 14:15:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745597727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:15:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029632363] [2025-03-17 14:15:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:15:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:15:08,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:15:08,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:15:08,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:08,671 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-03-17 14:15:08,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:08,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:08,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:09,116 INFO L124 PetriNetUnfolderBase]: 933/1517 cut-off events. [2025-03-17 14:15:09,116 INFO L125 PetriNetUnfolderBase]: For 2194/2194 co-relation queries the response was YES. [2025-03-17 14:15:09,119 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-03-17 14:15:09,121 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 45 selfloop transitions, 4 changer transitions 47/101 dead transitions. [2025-03-17 14:15:09,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 636 flow [2025-03-17 14:15:09,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2025-03-17 14:15:09,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2025-03-17 14:15:09,122 INFO L175 Difference]: Start difference. First operand has 86 places, 49 transitions, 274 flow. Second operand 10 states and 180 transitions. [2025-03-17 14:15:09,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 636 flow [2025-03-17 14:15:09,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 101 transitions, 569 flow, removed 19 selfloop flow, removed 12 redundant places. [2025-03-17 14:15:09,125 INFO L231 Difference]: Finished difference. Result has 79 places, 41 transitions, 174 flow [2025-03-17 14:15:09,125 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-03-17 14:15:09,125 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-03-17 14:15:09,125 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 41 transitions, 174 flow [2025-03-17 14:15:09,125 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-03-17 14:15:09,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:09,126 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-03-17 14:15:09,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 14:15:09,126 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-03-17 14:15:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash 365932575, now seen corresponding path program 11 times [2025-03-17 14:15:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:15:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771619876] [2025-03-17 14:15:09,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:15:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:15:09,131 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:09,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:09,172 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:09,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:15:09,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:15:09,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:09,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:15:09,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:15:09,242 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:15:09,243 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 14:15:09,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:15:09,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:15:09,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:15:09,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-17 14:15:09,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-17 14:15:09,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:15:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 14:15:09,245 INFO L422 BasicCegarLoop]: Path program histogram: [11, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:15:09,295 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:15:09,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:15:09,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:15:09 BasicIcfg [2025-03-17 14:15:09,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:15:09,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:15:09,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:15:09,299 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:15:09,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:18" (3/4) ... [2025-03-17 14:15:09,300 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:15:09,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:15:09,301 INFO L158 Benchmark]: Toolchain (without parser) took 52481.72ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 111.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-17 14:15:09,301 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:15:09,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.60ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 86.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:15:09,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:15:09,302 INFO L158 Benchmark]: Boogie Preprocessor took 44.02ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.3MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:15:09,302 INFO L158 Benchmark]: IcfgBuilder took 878.03ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 70.4MB in the end (delta: 8.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2025-03-17 14:15:09,302 INFO L158 Benchmark]: TraceAbstraction took 51107.04ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 69.6MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-17 14:15:09,302 INFO L158 Benchmark]: Witness Printer took 1.92ms. Allocated memory is still 4.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 556.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:15:09,303 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.23ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.60ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 86.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.73ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.02ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.3MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 878.03ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 70.4MB in the end (delta: 8.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 51107.04ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 69.6MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 1.92ms. Allocated memory is still 4.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 556.8kB). 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, 70 edges, 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: 51.0s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2321 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2313 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 5.5s 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.7s 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.7s 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-03-17 14:15:09,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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-?-8fc3dc6-m [2025-03-17 14:15:11,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:15:11,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:15:11,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:15:11,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:15:11,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:15:11,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:15:11,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:15:11,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:15:11,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:15:11,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:15:11,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:15:11,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:15:11,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:15:11,673 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:15:11,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:15:11,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:15:11,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:15:11,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:15:11,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:15:11,673 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:15:11,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:15:11,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:15:11,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:15:11,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:15:11,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:15:11,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:15:11,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:15:11,677 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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-03-17 14:15:11,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:15:11,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:15:11,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:15:11,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:15:11,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:15:11,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-17 14:15:13,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/931781f8f/2979eb038d974e1b9bf268ea6b0d753d/FLAG6a5ca8c80 [2025-03-17 14:15:13,218 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:15:13,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-17 14:15:13,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/931781f8f/2979eb038d974e1b9bf268ea6b0d753d/FLAG6a5ca8c80 [2025-03-17 14:15:13,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/931781f8f/2979eb038d974e1b9bf268ea6b0d753d [2025-03-17 14:15:13,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:15:13,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:15:13,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:15:13,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:15:13,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:15:13,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:13,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571648f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13, skipping insertion in model container [2025-03-17 14:15:13,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:13,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:15:13,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:15:13,848 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:15:13,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:15:13,935 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:15:13,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13 WrapperNode [2025-03-17 14:15:13,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:15:13,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:15:13,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:15:13,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:15:13,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:13,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:13,987 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2025-03-17 14:15:13,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:15:13,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:15:13,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:15:13,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:15:13,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:13,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,022 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:15:14,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:15:14,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:15:14,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:15:14,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:15:14,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (1/1) ... [2025-03-17 14:15:14,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:15:14,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:14,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:15:14,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:15:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:15:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:15:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:15:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:15:14,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:15:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:15:14,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:15:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:15:14,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:15:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:15:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:15:14,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:15:14,095 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:15:14,191 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:15:14,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:15:14,516 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:15:14,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:15:14,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:15:14,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:15:14,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:15:14 BoogieIcfgContainer [2025-03-17 14:15:14,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:15:14,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:15:14,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:15:14,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:15:14,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:15:13" (1/3) ... [2025-03-17 14:15:14,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c413de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:15:14, skipping insertion in model container [2025-03-17 14:15:14,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:15:13" (2/3) ... [2025-03-17 14:15:14,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c413de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:15:14, skipping insertion in model container [2025-03-17 14:15:14,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:15:14" (3/3) ... [2025-03-17 14:15:14,723 INFO L128 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-17 14:15:14,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:15:14,733 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-03-17 14:15:14,733 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:15:14,779 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:15:14,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2025-03-17 14:15:14,827 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2025-03-17 14:15:14,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:15:14,833 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-03-17 14:15:14,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2025-03-17 14:15:14,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2025-03-17 14:15:14,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:15:14,851 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;@31df4cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:15:14,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:15:14,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:15:14,858 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 14:15:14,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:15:14,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:14,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:15:14,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:15:14,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -501447140, now seen corresponding path program 1 times [2025-03-17 14:15:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713666430] [2025-03-17 14:15:14,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:15:14,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:14,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:14,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:14,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:15:14,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:15:14,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:15:14,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:14,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:14,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:15:14,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:15,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:15,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:15,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713666430] [2025-03-17 14:15:15,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713666430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:15,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:15,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:15:15,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460804018] [2025-03-17 14:15:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:15,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:15:15,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:15,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:15:15,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:15:15,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:15,056 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-03-17 14:15:15,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:15,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:15,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:16,163 INFO L124 PetriNetUnfolderBase]: 7377/10637 cut-off events. [2025-03-17 14:15:16,164 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:15:16,186 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-03-17 14:15:16,229 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-17 14:15:16,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-03-17 14:15:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:15:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:15:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-17 14:15:16,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2025-03-17 14:15:16,242 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 88 transitions. [2025-03-17 14:15:16,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-03-17 14:15:16,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:15:16,250 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2025-03-17 14:15:16,252 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-03-17 14:15:16,256 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-17 14:15:16,256 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2025-03-17 14:15:16,256 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-03-17 14:15:16,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:16,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:15:16,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:16,462 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-03-17 14:15:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1819506938, now seen corresponding path program 1 times [2025-03-17 14:15:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:16,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571583989] [2025-03-17 14:15:16,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:15:16,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:16,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:16,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:16,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:15:16,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:15:16,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:15:16,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:16,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:16,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:15:16,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:16,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:16,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:16,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571583989] [2025-03-17 14:15:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571583989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:16,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:16,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:15:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004113358] [2025-03-17 14:15:16,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:15:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:16,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:15:16,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:15:16,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-17 14:15:16,563 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-03-17 14:15:16,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:16,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-17 14:15:16,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:17,254 INFO L124 PetriNetUnfolderBase]: 6628/10280 cut-off events. [2025-03-17 14:15:17,255 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2025-03-17 14:15:17,267 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-03-17 14:15:17,299 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-03-17 14:15:17,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2025-03-17 14:15:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:15:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:15:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-17 14:15:17,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2025-03-17 14:15:17,300 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2025-03-17 14:15:17,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2025-03-17 14:15:17,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:15:17,305 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2025-03-17 14:15:17,306 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-03-17 14:15:17,306 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-03-17 14:15:17,306 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2025-03-17 14:15:17,306 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-03-17 14:15:17,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:17,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:15:17,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:17,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:17,507 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-03-17 14:15:17,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1819506008, now seen corresponding path program 1 times [2025-03-17 14:15:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:17,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968500689] [2025-03-17 14:15:17,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:15:17,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:17,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:17,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:17,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:15:17,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:15:17,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:15:17,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:17,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:17,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:15:17,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:17,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:17,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968500689] [2025-03-17 14:15:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968500689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:15:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649749303] [2025-03-17 14:15:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:17,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:15:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:17,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:15:17,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:15:17,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:17,607 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-03-17 14:15:17,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:17,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:17,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:18,290 INFO L124 PetriNetUnfolderBase]: 4634/7386 cut-off events. [2025-03-17 14:15:18,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:15:18,303 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-03-17 14:15:18,329 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 61 selfloop transitions, 5 changer transitions 1/73 dead transitions. [2025-03-17 14:15:18,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 292 flow [2025-03-17 14:15:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:15:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:15:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-03-17 14:15:18,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2025-03-17 14:15:18,332 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 4 states and 109 transitions. [2025-03-17 14:15:18,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 292 flow [2025-03-17 14:15:18,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:15:18,333 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2025-03-17 14:15:18,333 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-03-17 14:15:18,334 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2025-03-17 14:15:18,334 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2025-03-17 14:15:18,334 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-03-17 14:15:18,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:18,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:15:18,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:15:18,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:18,534 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-03-17 14:15:18,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1431633091, now seen corresponding path program 1 times [2025-03-17 14:15:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:18,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494352794] [2025-03-17 14:15:18,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:15:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:18,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:18,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:15:18,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:15:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:15:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:18,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:15:18,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:18,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:18,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494352794] [2025-03-17 14:15:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494352794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:18,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:18,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:15:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451409677] [2025-03-17 14:15:18,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:18,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:15:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:18,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:15:18,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:15:18,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:18,670 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-03-17 14:15:18,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:18,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:18,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:18,976 INFO L124 PetriNetUnfolderBase]: 2514/3996 cut-off events. [2025-03-17 14:15:18,977 INFO L125 PetriNetUnfolderBase]: For 707/707 co-relation queries the response was YES. [2025-03-17 14:15:18,981 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-03-17 14:15:18,989 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 78 selfloop transitions, 8 changer transitions 1/93 dead transitions. [2025-03-17 14:15:18,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 416 flow [2025-03-17 14:15:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:15:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:15:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-17 14:15:18,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2025-03-17 14:15:18,991 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 5 states and 139 transitions. [2025-03-17 14:15:18,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 416 flow [2025-03-17 14:15:18,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 406 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:15:18,993 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 153 flow [2025-03-17 14:15:18,994 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-03-17 14:15:18,994 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-03-17 14:15:18,994 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 153 flow [2025-03-17 14:15:18,994 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-03-17 14:15:18,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:18,994 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-03-17 14:15:19,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:19,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:19,195 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-03-17 14:15:19,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1660146650, now seen corresponding path program 1 times [2025-03-17 14:15:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2061077060] [2025-03-17 14:15:19,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:15:19,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:19,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:19,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:15:19,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:15:19,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:15:19,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:19,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:19,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:15:19,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:19,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:19,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061077060] [2025-03-17 14:15:19,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061077060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:19,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:19,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:15:19,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151831419] [2025-03-17 14:15:19,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:19,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:15:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:19,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:15:19,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:15:19,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:19,318 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-03-17 14:15:19,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:19,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:19,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:19,593 INFO L124 PetriNetUnfolderBase]: 1573/2421 cut-off events. [2025-03-17 14:15:19,593 INFO L125 PetriNetUnfolderBase]: For 1332/1332 co-relation queries the response was YES. [2025-03-17 14:15:19,597 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-03-17 14:15:19,601 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 65 selfloop transitions, 11 changer transitions 1/83 dead transitions. [2025-03-17 14:15:19,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 399 flow [2025-03-17 14:15:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:15:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:15:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-03-17 14:15:19,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2025-03-17 14:15:19,603 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 153 flow. Second operand 6 states and 139 transitions. [2025-03-17 14:15:19,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 399 flow [2025-03-17 14:15:19,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 374 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 14:15:19,609 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 167 flow [2025-03-17 14:15:19,609 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-03-17 14:15:19,609 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2025-03-17 14:15:19,609 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 167 flow [2025-03-17 14:15:19,610 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-03-17 14:15:19,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:19,610 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-03-17 14:15:19,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:15:19,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:19,811 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-03-17 14:15:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 716894669, now seen corresponding path program 1 times [2025-03-17 14:15:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633502589] [2025-03-17 14:15:19,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:15:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:19,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:19,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:15:19,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:19,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:19,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:19,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:19,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:15:19,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:20,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:20,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:20,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633502589] [2025-03-17 14:15:20,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633502589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:20,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:20,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:15:20,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478236998] [2025-03-17 14:15:20,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:20,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:15:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:20,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:15:20,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:15:20,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:20,124 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-03-17 14:15:20,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:20,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:20,606 INFO L124 PetriNetUnfolderBase]: 2145/3313 cut-off events. [2025-03-17 14:15:20,607 INFO L125 PetriNetUnfolderBase]: For 2224/2224 co-relation queries the response was YES. [2025-03-17 14:15:20,611 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-03-17 14:15:20,617 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 52 selfloop transitions, 8 changer transitions 60/126 dead transitions. [2025-03-17 14:15:20,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 695 flow [2025-03-17 14:15:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-03-17 14:15:20,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43873517786561267 [2025-03-17 14:15:20,619 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 167 flow. Second operand 11 states and 222 transitions. [2025-03-17 14:15:20,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 695 flow [2025-03-17 14:15:20,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 126 transitions, 562 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 14:15:20,628 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 185 flow [2025-03-17 14:15:20,628 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-03-17 14:15:20,629 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-03-17 14:15:20,629 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 185 flow [2025-03-17 14:15:20,629 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-03-17 14:15:20,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:20,629 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-03-17 14:15:20,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:15:20,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:20,830 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-03-17 14:15:20,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -830194359, now seen corresponding path program 2 times [2025-03-17 14:15:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402346057] [2025-03-17 14:15:20,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:15:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:20,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:20,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:15:20,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:20,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:20,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:20,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:20,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:15:20,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:21,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:21,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402346057] [2025-03-17 14:15:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402346057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:21,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:15:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573661545] [2025-03-17 14:15:21,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:21,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:21,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:21,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:21,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:21,238 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-03-17 14:15:21,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:21,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:21,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:21,711 INFO L124 PetriNetUnfolderBase]: 2027/3135 cut-off events. [2025-03-17 14:15:21,711 INFO L125 PetriNetUnfolderBase]: For 1287/1287 co-relation queries the response was YES. [2025-03-17 14:15:21,717 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-03-17 14:15:21,723 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 53 selfloop transitions, 9 changer transitions 51/119 dead transitions. [2025-03-17 14:15:21,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 119 transitions, 623 flow [2025-03-17 14:15:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2025-03-17 14:15:21,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44130434782608696 [2025-03-17 14:15:21,725 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 185 flow. Second operand 10 states and 203 transitions. [2025-03-17 14:15:21,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 119 transitions, 623 flow [2025-03-17 14:15:21,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 119 transitions, 595 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-03-17 14:15:21,730 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 221 flow [2025-03-17 14:15:21,730 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-03-17 14:15:21,732 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2025-03-17 14:15:21,733 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 221 flow [2025-03-17 14:15:21,733 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-03-17 14:15:21,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:21,734 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-03-17 14:15:21,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:15:21,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:21,934 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-03-17 14:15:21,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1478182247, now seen corresponding path program 3 times [2025-03-17 14:15:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016999510] [2025-03-17 14:15:21,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:15:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:21,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:21,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:15:21,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:22,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:22,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:15:22,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:22,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:15:22,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:22,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-03-17 14:15:22,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:22,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:22,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016999510] [2025-03-17 14:15:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016999510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:22,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:22,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:15:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552942743] [2025-03-17 14:15:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:22,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:15:22,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:22,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:15:22,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:15:22,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:22,111 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-03-17 14:15:22,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:22,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:22,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:22,456 INFO L124 PetriNetUnfolderBase]: 2153/3320 cut-off events. [2025-03-17 14:15:22,456 INFO L125 PetriNetUnfolderBase]: For 1869/1869 co-relation queries the response was YES. [2025-03-17 14:15:22,464 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-03-17 14:15:22,469 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 52 selfloop transitions, 2 changer transitions 27/87 dead transitions. [2025-03-17 14:15:22,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 498 flow [2025-03-17 14:15:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:15:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:15:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-03-17 14:15:22,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4384057971014493 [2025-03-17 14:15:22,471 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 221 flow. Second operand 6 states and 121 transitions. [2025-03-17 14:15:22,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 498 flow [2025-03-17 14:15:22,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 464 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-03-17 14:15:22,476 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 187 flow [2025-03-17 14:15:22,476 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-03-17 14:15:22,477 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-03-17 14:15:22,477 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 187 flow [2025-03-17 14:15:22,477 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-03-17 14:15:22,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:22,478 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-03-17 14:15:22,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:15:22,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:22,678 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-03-17 14:15:22,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -689385589, now seen corresponding path program 4 times [2025-03-17 14:15:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277147507] [2025-03-17 14:15:22,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:15:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:22,682 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:22,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:15:22,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:15:22,753 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-03-17 14:15:22,753 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:15:22,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:22,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:15:22,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:22,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-03-17 14:15:22,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:22,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:22,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277147507] [2025-03-17 14:15:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277147507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:15:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359313542] [2025-03-17 14:15:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:22,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:15:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:22,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:15:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:15:22,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:22,933 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-03-17 14:15:22,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:22,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:22,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:23,314 INFO L124 PetriNetUnfolderBase]: 1833/2870 cut-off events. [2025-03-17 14:15:23,314 INFO L125 PetriNetUnfolderBase]: For 1071/1071 co-relation queries the response was YES. [2025-03-17 14:15:23,318 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-03-17 14:15:23,321 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 51 selfloop transitions, 12 changer transitions 60/129 dead transitions. [2025-03-17 14:15:23,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 694 flow [2025-03-17 14:15:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2025-03-17 14:15:23,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43043478260869567 [2025-03-17 14:15:23,322 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 187 flow. Second operand 10 states and 198 transitions. [2025-03-17 14:15:23,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 694 flow [2025-03-17 14:15:23,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 652 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-17 14:15:23,325 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 256 flow [2025-03-17 14:15:23,325 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-03-17 14:15:23,325 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-03-17 14:15:23,325 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 256 flow [2025-03-17 14:15:23,325 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-03-17 14:15:23,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:23,327 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-03-17 14:15:23,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:15:23,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:23,527 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-03-17 14:15:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1997175181, now seen corresponding path program 5 times [2025-03-17 14:15:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1506018958] [2025-03-17 14:15:23,528 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:15:23,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:23,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:23,530 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:23,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:15:23,581 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:23,600 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:23,600 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:23,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:23,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:15:23,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:23,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:23,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:23,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506018958] [2025-03-17 14:15:23,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506018958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:23,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:23,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:15:23,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894563437] [2025-03-17 14:15:23,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:23,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:15:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:23,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:15:23,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:15:23,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:23,944 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-03-17 14:15:23,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:23,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:23,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:24,450 INFO L124 PetriNetUnfolderBase]: 1479/2339 cut-off events. [2025-03-17 14:15:24,450 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2025-03-17 14:15:24,454 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-03-17 14:15:24,459 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 53 selfloop transitions, 9 changer transitions 47/115 dead transitions. [2025-03-17 14:15:24,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 115 transitions, 671 flow [2025-03-17 14:15:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2025-03-17 14:15:24,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893280632411067 [2025-03-17 14:15:24,461 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 256 flow. Second operand 11 states and 197 transitions. [2025-03-17 14:15:24,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 115 transitions, 671 flow [2025-03-17 14:15:24,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 639 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-03-17 14:15:24,465 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 283 flow [2025-03-17 14:15:24,468 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-03-17 14:15:24,469 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2025-03-17 14:15:24,469 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 283 flow [2025-03-17 14:15:24,469 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-03-17 14:15:24,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:24,469 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-03-17 14:15:24,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:24,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:24,670 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-03-17 14:15:24,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash 660465197, now seen corresponding path program 6 times [2025-03-17 14:15:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033632977] [2025-03-17 14:15:24,671 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:15:24,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:24,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:24,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:15:24,722 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:24,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:24,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:15:24,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:24,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:15:24,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:24,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:24,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033632977] [2025-03-17 14:15:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033632977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:24,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:24,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:15:24,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044738580] [2025-03-17 14:15:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:24,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:24,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:24,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:24,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:24,947 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-03-17 14:15:24,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:24,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:24,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:25,498 INFO L124 PetriNetUnfolderBase]: 2083/3284 cut-off events. [2025-03-17 14:15:25,498 INFO L125 PetriNetUnfolderBase]: For 2512/2512 co-relation queries the response was YES. [2025-03-17 14:15:25,504 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-03-17 14:15:25,508 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 73 selfloop transitions, 16 changer transitions 52/147 dead transitions. [2025-03-17 14:15:25,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 885 flow [2025-03-17 14:15:25,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2025-03-17 14:15:25,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41699604743083 [2025-03-17 14:15:25,511 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 283 flow. Second operand 11 states and 211 transitions. [2025-03-17 14:15:25,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 885 flow [2025-03-17 14:15:25,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 147 transitions, 847 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-03-17 14:15:25,514 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 359 flow [2025-03-17 14:15:25,514 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-03-17 14:15:25,515 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-03-17 14:15:25,515 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 359 flow [2025-03-17 14:15:25,516 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-03-17 14:15:25,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:25,516 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-03-17 14:15:25,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:15:25,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:25,716 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-03-17 14:15:25,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1990186581, now seen corresponding path program 7 times [2025-03-17 14:15:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336665495] [2025-03-17 14:15:25,717 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:15:25,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:25,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:25,720 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:25,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:15:25,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:25,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:25,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:25,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:25,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:15:25,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:26,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:26,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:26,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336665495] [2025-03-17 14:15:26,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336665495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:26,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:26,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:15:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825028564] [2025-03-17 14:15:26,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:26,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:15:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:26,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:15:26,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:15:26,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:26,142 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-03-17 14:15:26,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:26,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:26,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:26,599 INFO L124 PetriNetUnfolderBase]: 1861/2949 cut-off events. [2025-03-17 14:15:26,599 INFO L125 PetriNetUnfolderBase]: For 4774/4774 co-relation queries the response was YES. [2025-03-17 14:15:26,605 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-03-17 14:15:26,611 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 59 selfloop transitions, 8 changer transitions 43/116 dead transitions. [2025-03-17 14:15:26,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 767 flow [2025-03-17 14:15:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-03-17 14:15:26,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3794466403162055 [2025-03-17 14:15:26,612 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 359 flow. Second operand 11 states and 192 transitions. [2025-03-17 14:15:26,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 767 flow [2025-03-17 14:15:26,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 116 transitions, 699 flow, removed 22 selfloop flow, removed 10 redundant places. [2025-03-17 14:15:26,622 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 335 flow [2025-03-17 14:15:26,622 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-03-17 14:15:26,622 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-03-17 14:15:26,622 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 335 flow [2025-03-17 14:15:26,623 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-03-17 14:15:26,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:26,623 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-03-17 14:15:26,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:26,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:26,823 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-03-17 14:15:26,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash 745945789, now seen corresponding path program 8 times [2025-03-17 14:15:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230267769] [2025-03-17 14:15:26,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:15:26,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:26,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:26,826 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:26,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:15:26,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:26,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:26,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:26,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:26,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:15:26,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:27,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:27,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:27,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230267769] [2025-03-17 14:15:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230267769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:27,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:15:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355438368] [2025-03-17 14:15:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:27,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:27,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:27,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:27,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:27,099 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-03-17 14:15:27,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:27,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:27,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:27,561 INFO L124 PetriNetUnfolderBase]: 2268/3583 cut-off events. [2025-03-17 14:15:27,561 INFO L125 PetriNetUnfolderBase]: For 4164/4164 co-relation queries the response was YES. [2025-03-17 14:15:27,567 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-03-17 14:15:27,571 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 75 selfloop transitions, 10 changer transitions 40/131 dead transitions. [2025-03-17 14:15:27,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 845 flow [2025-03-17 14:15:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2025-03-17 14:15:27,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4108695652173913 [2025-03-17 14:15:27,573 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 335 flow. Second operand 10 states and 189 transitions. [2025-03-17 14:15:27,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 845 flow [2025-03-17 14:15:27,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 131 transitions, 801 flow, removed 13 selfloop flow, removed 11 redundant places. [2025-03-17 14:15:27,579 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 301 flow [2025-03-17 14:15:27,579 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-03-17 14:15:27,579 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-03-17 14:15:27,579 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 301 flow [2025-03-17 14:15:27,579 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-03-17 14:15:27,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:27,580 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-03-17 14:15:27,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:27,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:27,780 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-03-17 14:15:27,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash 257024011, now seen corresponding path program 9 times [2025-03-17 14:15:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:27,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135312926] [2025-03-17 14:15:27,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:15:27,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:27,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:27,783 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:27,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:15:27,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:27,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:27,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:15:27,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:27,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 14:15:27,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:28,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:28,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135312926] [2025-03-17 14:15:28,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135312926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:28,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:28,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:15:28,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838007935] [2025-03-17 14:15:28,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:28,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:15:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:28,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:15:28,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:15:28,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:28,116 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-03-17 14:15:28,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:28,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:28,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:28,662 INFO L124 PetriNetUnfolderBase]: 2361/3737 cut-off events. [2025-03-17 14:15:28,662 INFO L125 PetriNetUnfolderBase]: For 4938/4938 co-relation queries the response was YES. [2025-03-17 14:15:28,669 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-03-17 14:15:28,675 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 69 selfloop transitions, 8 changer transitions 46/129 dead transitions. [2025-03-17 14:15:28,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 840 flow [2025-03-17 14:15:28,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-17 14:15:28,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39920948616600793 [2025-03-17 14:15:28,676 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 301 flow. Second operand 11 states and 202 transitions. [2025-03-17 14:15:28,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 840 flow [2025-03-17 14:15:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 129 transitions, 786 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-17 14:15:28,682 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 326 flow [2025-03-17 14:15:28,682 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-03-17 14:15:28,682 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-03-17 14:15:28,682 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 326 flow [2025-03-17 14:15:28,683 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-03-17 14:15:28,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:28,683 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-03-17 14:15:28,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 14:15:28,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:28,883 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-03-17 14:15:28,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1097024961, now seen corresponding path program 10 times [2025-03-17 14:15:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:28,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70386273] [2025-03-17 14:15:28,884 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:15:28,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:28,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:28,886 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:28,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:15:28,941 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:15:28,956 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-03-17 14:15:28,956 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:15:28,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:28,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:15:28,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:29,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:29,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:29,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70386273] [2025-03-17 14:15:29,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70386273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:29,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:29,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:15:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061068614] [2025-03-17 14:15:29,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:29,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:15:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:29,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:15:29,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:15:29,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:29,352 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-03-17 14:15:29,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:29,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:29,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:29,750 INFO L124 PetriNetUnfolderBase]: 2321/3678 cut-off events. [2025-03-17 14:15:29,750 INFO L125 PetriNetUnfolderBase]: For 5031/5031 co-relation queries the response was YES. [2025-03-17 14:15:29,756 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-03-17 14:15:29,761 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 61 selfloop transitions, 13 changer transitions 36/116 dead transitions. [2025-03-17 14:15:29,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 812 flow [2025-03-17 14:15:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:15:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:15:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2025-03-17 14:15:29,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-17 14:15:29,763 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 326 flow. Second operand 8 states and 161 transitions. [2025-03-17 14:15:29,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 812 flow [2025-03-17 14:15:29,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 764 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-03-17 14:15:29,771 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 420 flow [2025-03-17 14:15:29,771 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-03-17 14:15:29,772 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-03-17 14:15:29,772 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 420 flow [2025-03-17 14:15:29,772 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-03-17 14:15:29,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:29,772 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-03-17 14:15:29,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:15:29,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:29,973 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-03-17 14:15:29,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1562067051, now seen corresponding path program 11 times [2025-03-17 14:15:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167832778] [2025-03-17 14:15:29,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:15:29,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:29,976 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:29,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:15:30,022 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:30,038 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:30,038 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:30,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:30,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:15:30,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:30,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:30,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:30,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167832778] [2025-03-17 14:15:30,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167832778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:30,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:30,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:15:30,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932196698] [2025-03-17 14:15:30,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:30,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:30,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:30,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:30,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:30,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:30,211 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-03-17 14:15:30,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:30,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:30,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:30,556 INFO L124 PetriNetUnfolderBase]: 2400/3810 cut-off events. [2025-03-17 14:15:30,556 INFO L125 PetriNetUnfolderBase]: For 6038/6038 co-relation queries the response was YES. [2025-03-17 14:15:30,563 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-03-17 14:15:30,568 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 60 selfloop transitions, 5 changer transitions 46/117 dead transitions. [2025-03-17 14:15:30,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 858 flow [2025-03-17 14:15:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2025-03-17 14:15:30,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2025-03-17 14:15:30,569 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 420 flow. Second operand 10 states and 176 transitions. [2025-03-17 14:15:30,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 858 flow [2025-03-17 14:15:30,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 800 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-17 14:15:30,575 INFO L231 Difference]: Finished difference. Result has 89 places, 63 transitions, 382 flow [2025-03-17 14:15:30,575 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-03-17 14:15:30,576 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2025-03-17 14:15:30,576 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 63 transitions, 382 flow [2025-03-17 14:15:30,576 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-03-17 14:15:30,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:30,576 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-03-17 14:15:30,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:30,777 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-03-17 14:15:30,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2073131205, now seen corresponding path program 12 times [2025-03-17 14:15:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:30,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104000951] [2025-03-17 14:15:30,777 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:15:30,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:30,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:30,779 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:30,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 14:15:30,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:30,841 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:30,841 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:15:30,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:30,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:15:30,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:31,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:31,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104000951] [2025-03-17 14:15:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104000951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:15:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468613166] [2025-03-17 14:15:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:31,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:31,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:31,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:31,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:31,037 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-03-17 14:15:31,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:31,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:31,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:31,399 INFO L124 PetriNetUnfolderBase]: 2187/3481 cut-off events. [2025-03-17 14:15:31,399 INFO L125 PetriNetUnfolderBase]: For 4578/4578 co-relation queries the response was YES. [2025-03-17 14:15:31,408 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-03-17 14:15:31,414 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 50 selfloop transitions, 2 changer transitions 56/114 dead transitions. [2025-03-17 14:15:31,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 776 flow [2025-03-17 14:15:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2025-03-17 14:15:31,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3847826086956522 [2025-03-17 14:15:31,415 INFO L175 Difference]: Start difference. First operand has 89 places, 63 transitions, 382 flow. Second operand 10 states and 177 transitions. [2025-03-17 14:15:31,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 776 flow [2025-03-17 14:15:31,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 114 transitions, 733 flow, removed 13 selfloop flow, removed 12 redundant places. [2025-03-17 14:15:31,422 INFO L231 Difference]: Finished difference. Result has 86 places, 57 transitions, 303 flow [2025-03-17 14:15:31,422 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-03-17 14:15:31,423 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2025-03-17 14:15:31,423 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 57 transitions, 303 flow [2025-03-17 14:15:31,423 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-03-17 14:15:31,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:31,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-03-17 14:15:31,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 14:15:31,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:31,624 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-03-17 14:15:31,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash -302331023, now seen corresponding path program 13 times [2025-03-17 14:15:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:31,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638245220] [2025-03-17 14:15:31,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:15:31,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:31,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:31,626 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:31,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 14:15:31,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:31,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:31,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:31,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:31,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:15:31,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:31,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:31,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638245220] [2025-03-17 14:15:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638245220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:31,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:31,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:15:31,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851989943] [2025-03-17 14:15:31,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:31,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:15:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:31,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:15:31,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:15:31,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:31,974 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-03-17 14:15:31,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:31,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:31,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:32,434 INFO L124 PetriNetUnfolderBase]: 2052/3270 cut-off events. [2025-03-17 14:15:32,434 INFO L125 PetriNetUnfolderBase]: For 3902/3902 co-relation queries the response was YES. [2025-03-17 14:15:32,440 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-03-17 14:15:32,444 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 70 selfloop transitions, 10 changer transitions 46/132 dead transitions. [2025-03-17 14:15:32,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 132 transitions, 860 flow [2025-03-17 14:15:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2025-03-17 14:15:32,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4031620553359684 [2025-03-17 14:15:32,445 INFO L175 Difference]: Start difference. First operand has 86 places, 57 transitions, 303 flow. Second operand 11 states and 204 transitions. [2025-03-17 14:15:32,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 132 transitions, 860 flow [2025-03-17 14:15:32,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 132 transitions, 798 flow, removed 27 selfloop flow, removed 12 redundant places. [2025-03-17 14:15:32,450 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 334 flow [2025-03-17 14:15:32,450 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-03-17 14:15:32,451 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-03-17 14:15:32,451 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 334 flow [2025-03-17 14:15:32,451 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-03-17 14:15:32,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:32,451 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-03-17 14:15:32,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 14:15:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:32,651 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-03-17 14:15:32,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1870701863, now seen corresponding path program 14 times [2025-03-17 14:15:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802028018] [2025-03-17 14:15:32,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:15:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:32,654 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:32,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 14:15:32,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:32,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:32,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:32,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:32,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:15:32,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:32,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-03-17 14:15:32,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:32,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:32,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802028018] [2025-03-17 14:15:32,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802028018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:32,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:15:32,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314176524] [2025-03-17 14:15:32,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:32,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:32,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:32,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:32,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:32,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:32,912 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-03-17 14:15:32,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:32,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:32,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:33,276 INFO L124 PetriNetUnfolderBase]: 1966/3112 cut-off events. [2025-03-17 14:15:33,277 INFO L125 PetriNetUnfolderBase]: For 3630/3630 co-relation queries the response was YES. [2025-03-17 14:15:33,283 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-03-17 14:15:33,288 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 60 selfloop transitions, 7 changer transitions 55/128 dead transitions. [2025-03-17 14:15:33,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 843 flow [2025-03-17 14:15:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:15:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:15:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2025-03-17 14:15:33,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4108695652173913 [2025-03-17 14:15:33,289 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 334 flow. Second operand 10 states and 189 transitions. [2025-03-17 14:15:33,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 843 flow [2025-03-17 14:15:33,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 799 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-03-17 14:15:33,293 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 305 flow [2025-03-17 14:15:33,293 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-03-17 14:15:33,293 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2025-03-17 14:15:33,293 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 305 flow [2025-03-17 14:15:33,293 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-03-17 14:15:33,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:33,293 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-03-17 14:15:33,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-17 14:15:33,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:33,494 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-03-17 14:15:33,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash -554653983, now seen corresponding path program 15 times [2025-03-17 14:15:33,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:33,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044459420] [2025-03-17 14:15:33,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:15:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:33,497 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:33,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 14:15:33,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:33,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:33,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:15:33,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:33,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:15:33,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:33,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:33,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:33,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044459420] [2025-03-17 14:15:33,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044459420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:33,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:33,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:15:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664015682] [2025-03-17 14:15:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:33,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:15:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:33,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:15:33,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:15:33,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:33,801 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-03-17 14:15:33,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:33,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:33,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:34,190 INFO L124 PetriNetUnfolderBase]: 1491/2371 cut-off events. [2025-03-17 14:15:34,190 INFO L125 PetriNetUnfolderBase]: For 2316/2316 co-relation queries the response was YES. [2025-03-17 14:15:34,194 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-03-17 14:15:34,197 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 67 selfloop transitions, 10 changer transitions 36/119 dead transitions. [2025-03-17 14:15:34,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 729 flow [2025-03-17 14:15:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:15:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:15:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-03-17 14:15:34,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38735177865612647 [2025-03-17 14:15:34,198 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 305 flow. Second operand 11 states and 196 transitions. [2025-03-17 14:15:34,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 729 flow [2025-03-17 14:15:34,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 669 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-03-17 14:15:34,201 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 283 flow [2025-03-17 14:15:34,201 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-03-17 14:15:34,201 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-03-17 14:15:34,201 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 283 flow [2025-03-17 14:15:34,202 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-03-17 14:15:34,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:34,202 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-03-17 14:15:34,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 14:15:34,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:34,402 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-03-17 14:15:34,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash 840606813, now seen corresponding path program 16 times [2025-03-17 14:15:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:34,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149011445] [2025-03-17 14:15:34,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:15:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:34,404 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:34,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 14:15:34,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:15:34,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-03-17 14:15:34,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:15:34,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:34,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:15:34,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:34,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:34,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:34,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149011445] [2025-03-17 14:15:34,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149011445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:34,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:34,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:15:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527933363] [2025-03-17 14:15:34,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:34,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:15:34,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:34,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:15:34,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:15:34,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:34,589 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-03-17 14:15:34,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:34,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:34,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:34,873 INFO L124 PetriNetUnfolderBase]: 1427/2283 cut-off events. [2025-03-17 14:15:34,873 INFO L125 PetriNetUnfolderBase]: For 2617/2617 co-relation queries the response was YES. [2025-03-17 14:15:34,877 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-03-17 14:15:34,881 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 45 selfloop transitions, 3 changer transitions 44/98 dead transitions. [2025-03-17 14:15:34,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 611 flow [2025-03-17 14:15:34,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:15:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:15:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2025-03-17 14:15:34,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-17 14:15:34,882 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 283 flow. Second operand 9 states and 161 transitions. [2025-03-17 14:15:34,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 611 flow [2025-03-17 14:15:34,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 571 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-03-17 14:15:34,886 INFO L231 Difference]: Finished difference. Result has 78 places, 52 transitions, 239 flow [2025-03-17 14:15:34,886 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-03-17 14:15:34,886 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2025-03-17 14:15:34,886 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 52 transitions, 239 flow [2025-03-17 14:15:34,886 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-03-17 14:15:34,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:34,886 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-03-17 14:15:34,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-17 14:15:35,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:35,087 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-03-17 14:15:35,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash -164426811, now seen corresponding path program 17 times [2025-03-17 14:15:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313041246] [2025-03-17 14:15:35,087 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:15:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:35,089 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:35,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 14:15:35,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:35,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:35,160 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:15:35,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:35,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 14:15:35,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:35,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:35,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313041246] [2025-03-17 14:15:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313041246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:35,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:35,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 14:15:35,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775123005] [2025-03-17 14:15:35,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:35,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:15:35,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:35,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:15:35,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:15:35,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:35,534 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-03-17 14:15:35,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:35,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:35,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:35,971 INFO L124 PetriNetUnfolderBase]: 1316/2118 cut-off events. [2025-03-17 14:15:35,971 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2025-03-17 14:15:35,974 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-03-17 14:15:35,977 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 67 selfloop transitions, 18 changer transitions 40/131 dead transitions. [2025-03-17 14:15:35,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 131 transitions, 818 flow [2025-03-17 14:15:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:15:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:15:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 248 transitions. [2025-03-17 14:15:35,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38509316770186336 [2025-03-17 14:15:35,979 INFO L175 Difference]: Start difference. First operand has 78 places, 52 transitions, 239 flow. Second operand 14 states and 248 transitions. [2025-03-17 14:15:35,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 131 transitions, 818 flow [2025-03-17 14:15:35,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 749 flow, removed 17 selfloop flow, removed 13 redundant places. [2025-03-17 14:15:35,982 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 386 flow [2025-03-17 14:15:35,983 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-03-17 14:15:35,983 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2025-03-17 14:15:35,983 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 386 flow [2025-03-17 14:15:35,983 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-03-17 14:15:35,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:35,983 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-03-17 14:15:35,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 14:15:36,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:36,184 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-03-17 14:15:36,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2036901499, now seen corresponding path program 18 times [2025-03-17 14:15:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722080185] [2025-03-17 14:15:36,184 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:15:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:36,186 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:36,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 14:15:36,232 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:36,247 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:36,247 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:15:36,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:36,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 14:15:36,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:15:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:15:36,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:15:36,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:15:36,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722080185] [2025-03-17 14:15:36,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722080185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:15:36,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:15:36,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 14:15:36,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987930474] [2025-03-17 14:15:36,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:15:36,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:15:36,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:15:36,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:15:36,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:15:36,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-17 14:15:36,582 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-03-17 14:15:36,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:15:36,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-17 14:15:36,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:15:37,042 INFO L124 PetriNetUnfolderBase]: 1124/1830 cut-off events. [2025-03-17 14:15:37,042 INFO L125 PetriNetUnfolderBase]: For 2196/2196 co-relation queries the response was YES. [2025-03-17 14:15:37,046 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-03-17 14:15:37,049 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 72 selfloop transitions, 19 changer transitions 39/136 dead transitions. [2025-03-17 14:15:37,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 136 transitions, 925 flow [2025-03-17 14:15:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:15:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:15:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 236 transitions. [2025-03-17 14:15:37,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39464882943143814 [2025-03-17 14:15:37,051 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 386 flow. Second operand 13 states and 236 transitions. [2025-03-17 14:15:37,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 136 transitions, 925 flow [2025-03-17 14:15:37,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 136 transitions, 871 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-17 14:15:37,056 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 443 flow [2025-03-17 14:15:37,056 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-03-17 14:15:37,056 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2025-03-17 14:15:37,056 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 443 flow [2025-03-17 14:15:37,057 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-03-17 14:15:37,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:15:37,057 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-03-17 14:15:37,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 14:15:37,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:37,257 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-03-17 14:15:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:15:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1720212945, now seen corresponding path program 19 times [2025-03-17 14:15:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:15:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266707603] [2025-03-17 14:15:37,258 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:15:37,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:15:37,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:15:37,260 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:15:37,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 14:15:37,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:15:37,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:15:37,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:15:37,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:15:37,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 14:15:37,335 INFO L279 TraceCheckSpWp]: Computing forward predicates...