./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix010.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix010.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:15:20,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:15:20,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:15:20,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:15:20,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:15:20,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:15:20,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:15:20,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:15:20,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:15:20,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:15:20,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:15:20,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:15:20,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:15:20,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:15:20,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:15:20,776 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:15:20,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:15:20,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:15:20,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:15:20,778 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a [2025-02-08 08:15:20,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:15:20,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:15:20,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:15:20,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:15:20,990 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:15:20,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2025-02-08 08:15:22,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f35adb2f/2d7976474a6640818973a3a6d2e5c21b/FLAG456c26335 [2025-02-08 08:15:22,160 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-08 08:15:22,419 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:15:22,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2025-02-08 08:15:22,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f35adb2f/2d7976474a6640818973a3a6d2e5c21b/FLAG456c26335 [2025-02-08 08:15:22,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f35adb2f/2d7976474a6640818973a3a6d2e5c21b [2025-02-08 08:15:22,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:15:22,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:15:22,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:15:22,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:15:22,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:15:22,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403e1c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22, skipping insertion in model container [2025-02-08 08:15:22,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:15:22,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:15:22,771 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:15:22,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:15:22,861 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:15:22,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22 WrapperNode [2025-02-08 08:15:22,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:15:22,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:15:22,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:15:22,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:15:22,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,905 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2025-02-08 08:15:22,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:15:22,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:15:22,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:15:22,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:15:22,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,940 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:15:22,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:15:22,962 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:15:22,962 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:15:22,962 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:15:22,963 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (1/1) ... [2025-02-08 08:15:22,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:15:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:22,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:15:22,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:15:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:15:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:15:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:15:23,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:15:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:15:23,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:15:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:15:23,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:15:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:15:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:15:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:15:23,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:15:23,016 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:15:23,131 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:15:23,133 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:15:23,452 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:15:23,452 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:15:23,666 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:15:23,666 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:15:23,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:15:23 BoogieIcfgContainer [2025-02-08 08:15:23,667 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:15:23,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:15:23,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:15:23,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:15:23,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:15:22" (1/3) ... [2025-02-08 08:15:23,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53554186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:15:23, skipping insertion in model container [2025-02-08 08:15:23,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:22" (2/3) ... [2025-02-08 08:15:23,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53554186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:15:23, skipping insertion in model container [2025-02-08 08:15:23,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:15:23" (3/3) ... [2025-02-08 08:15:23,676 INFO L128 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2025-02-08 08:15:23,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:15:23,691 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix010.opt.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:15:23,691 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:15:23,738 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:15:23,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2025-02-08 08:15:23,791 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2025-02-08 08:15:23,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:15:23,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-02-08 08:15:23,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2025-02-08 08:15:23,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2025-02-08 08:15:23,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:15:23,822 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;@3cb9b744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:15:23,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:15:23,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:15:23,835 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-02-08 08:15:23,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:15:23,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:23,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:23,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:23,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash 123054331, now seen corresponding path program 1 times [2025-02-08 08:15:23,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621056877] [2025-02-08 08:15:23,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:23,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:15:23,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:15:23,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:23,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621056877] [2025-02-08 08:15:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621056877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:24,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:15:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264533329] [2025-02-08 08:15:24,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:24,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:15:24,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:24,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:15:24,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:15:24,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:24,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:24,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:24,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:24,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:25,495 INFO L124 PetriNetUnfolderBase]: 8459/12119 cut-off events. [2025-02-08 08:15:25,495 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-08 08:15:25,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24162 conditions, 12119 events. 8459/12119 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 67629 event pairs, 947 based on Foata normal form. 672/12772 useless extension candidates. Maximal degree in co-relation 24151. Up to 10393 conditions per place. [2025-02-08 08:15:25,564 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 50 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-02-08 08:15:25,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 239 flow [2025-02-08 08:15:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:15:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:15:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-08 08:15:25,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2025-02-08 08:15:25,579 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 89 transitions. [2025-02-08 08:15:25,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 239 flow [2025-02-08 08:15:25,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:15:25,586 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2025-02-08 08:15:25,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-08 08:15:25,592 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-02-08 08:15:25,593 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2025-02-08 08:15:25,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:25,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:25,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:25,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:15:25,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:25,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1528133452, now seen corresponding path program 1 times [2025-02-08 08:15:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:25,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798447626] [2025-02-08 08:15:25,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:25,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:15:25,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:15:25,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:25,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:25,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-02-08 08:15:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798447626] [2025-02-08 08:15:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798447626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:15:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418544629] [2025-02-08 08:15:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:15:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:25,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:15:25,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:15:25,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:25,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:25,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:25,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:25,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:26,529 INFO L124 PetriNetUnfolderBase]: 7597/11527 cut-off events. [2025-02-08 08:15:26,530 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-02-08 08:15:26,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22803 conditions, 11527 events. 7597/11527 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 69426 event pairs, 7597 based on Foata normal form. 336/11778 useless extension candidates. Maximal degree in co-relation 22793. Up to 10730 conditions per place. [2025-02-08 08:15:26,600 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 30 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2025-02-08 08:15:26,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 150 flow [2025-02-08 08:15:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:15:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:15:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 08:15:26,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2025-02-08 08:15:26,601 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 60 transitions. [2025-02-08 08:15:26,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 150 flow [2025-02-08 08:15:26,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:15:26,607 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2025-02-08 08:15:26,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-08 08:15:26,608 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-08 08:15:26,608 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2025-02-08 08:15:26,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:26,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:26,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:26,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:15:26,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:26,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1528133574, now seen corresponding path program 1 times [2025-02-08 08:15:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945337822] [2025-02-08 08:15:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:26,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:15:26,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:15:26,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:26,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945337822] [2025-02-08 08:15:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945337822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:26,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:15:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264440683] [2025-02-08 08:15:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:26,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:15:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:26,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:15:26,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:15:26,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:26,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:26,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:26,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:26,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:27,967 INFO L124 PetriNetUnfolderBase]: 9715/14463 cut-off events. [2025-02-08 08:15:27,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:15:27,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28385 conditions, 14463 events. 9715/14463 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 87549 event pairs, 4249 based on Foata normal form. 0/14133 useless extension candidates. Maximal degree in co-relation 28379. Up to 9207 conditions per place. [2025-02-08 08:15:28,009 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 42 selfloop transitions, 4 changer transitions 74/125 dead transitions. [2025-02-08 08:15:28,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 125 transitions, 502 flow [2025-02-08 08:15:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:15:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:15:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-02-08 08:15:28,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5159574468085106 [2025-02-08 08:15:28,010 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 8 states and 194 transitions. [2025-02-08 08:15:28,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 125 transitions, 502 flow [2025-02-08 08:15:28,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 125 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:15:28,014 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 125 flow [2025-02-08 08:15:28,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2025-02-08 08:15:28,015 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-02-08 08:15:28,015 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 125 flow [2025-02-08 08:15:28,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:28,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:28,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:28,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:15:28,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:28,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1344008176, now seen corresponding path program 1 times [2025-02-08 08:15:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:28,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66730019] [2025-02-08 08:15:28,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:28,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:15:28,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:15:28,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:28,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66730019] [2025-02-08 08:15:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66730019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:28,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:15:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183952253] [2025-02-08 08:15:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:28,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:28,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:28,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:28,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:28,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:28,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:28,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:28,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:29,201 INFO L124 PetriNetUnfolderBase]: 7068/10506 cut-off events. [2025-02-08 08:15:29,202 INFO L125 PetriNetUnfolderBase]: For 6974/6974 co-relation queries the response was YES. [2025-02-08 08:15:29,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25926 conditions, 10506 events. 7068/10506 cut-off events. For 6974/6974 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 59851 event pairs, 2203 based on Foata normal form. 304/10797 useless extension candidates. Maximal degree in co-relation 25914. Up to 6035 conditions per place. [2025-02-08 08:15:29,257 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 48 selfloop transitions, 3 changer transitions 61/117 dead transitions. [2025-02-08 08:15:29,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 589 flow [2025-02-08 08:15:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:15:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:15:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-02-08 08:15:29,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5288753799392097 [2025-02-08 08:15:29,260 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 125 flow. Second operand 7 states and 174 transitions. [2025-02-08 08:15:29,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 589 flow [2025-02-08 08:15:29,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 577 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 08:15:29,306 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 136 flow [2025-02-08 08:15:29,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-02-08 08:15:29,307 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-02-08 08:15:29,308 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 136 flow [2025-02-08 08:15:29,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:29,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:29,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:29,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:15:29,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:29,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2027565182, now seen corresponding path program 1 times [2025-02-08 08:15:29,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:29,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342831437] [2025-02-08 08:15:29,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:29,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:15:29,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:15:29,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:29,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342831437] [2025-02-08 08:15:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342831437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:29,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:15:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501775418] [2025-02-08 08:15:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:29,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:29,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:29,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:29,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:29,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:29,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:29,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:29,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:29,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:30,217 INFO L124 PetriNetUnfolderBase]: 6140/9110 cut-off events. [2025-02-08 08:15:30,218 INFO L125 PetriNetUnfolderBase]: For 8365/8365 co-relation queries the response was YES. [2025-02-08 08:15:30,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23138 conditions, 9110 events. 6140/9110 cut-off events. For 8365/8365 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 49555 event pairs, 1439 based on Foata normal form. 210/9307 useless extension candidates. Maximal degree in co-relation 23122. Up to 5756 conditions per place. [2025-02-08 08:15:30,259 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 47 selfloop transitions, 3 changer transitions 51/106 dead transitions. [2025-02-08 08:15:30,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 539 flow [2025-02-08 08:15:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:15:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:15:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-02-08 08:15:30,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49544072948328266 [2025-02-08 08:15:30,265 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 136 flow. Second operand 7 states and 163 transitions. [2025-02-08 08:15:30,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 539 flow [2025-02-08 08:15:30,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 106 transitions, 515 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 08:15:30,299 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 141 flow [2025-02-08 08:15:30,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-02-08 08:15:30,300 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-02-08 08:15:30,300 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 141 flow [2025-02-08 08:15:30,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:30,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:30,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] [2025-02-08 08:15:30,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:15:30,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -40245938, now seen corresponding path program 1 times [2025-02-08 08:15:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320345716] [2025-02-08 08:15:30,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:30,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:15:30,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:15:30,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:30,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:30,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320345716] [2025-02-08 08:15:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320345716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:30,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:30,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:15:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280413227] [2025-02-08 08:15:30,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:30,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:15:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:30,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:15:30,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:15:30,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:30,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:30,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:30,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:30,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:30,864 INFO L124 PetriNetUnfolderBase]: 4486/6832 cut-off events. [2025-02-08 08:15:30,864 INFO L125 PetriNetUnfolderBase]: For 5492/5492 co-relation queries the response was YES. [2025-02-08 08:15:30,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17288 conditions, 6832 events. 4486/6832 cut-off events. For 5492/5492 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 37372 event pairs, 855 based on Foata normal form. 336/7157 useless extension candidates. Maximal degree in co-relation 17271. Up to 3268 conditions per place. [2025-02-08 08:15:30,894 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 67 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-02-08 08:15:30,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 413 flow [2025-02-08 08:15:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:15:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:15:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-08 08:15:30,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-02-08 08:15:30,895 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 141 flow. Second operand 4 states and 112 transitions. [2025-02-08 08:15:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 413 flow [2025-02-08 08:15:30,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 395 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-08 08:15:30,907 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 161 flow [2025-02-08 08:15:30,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-02-08 08:15:30,908 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-02-08 08:15:30,908 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 161 flow [2025-02-08 08:15:30,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:30,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:30,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:30,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:15:30,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:30,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1856872736, now seen corresponding path program 1 times [2025-02-08 08:15:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456311348] [2025-02-08 08:15:30,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:30,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:15:30,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:15:30,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:30,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:31,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:31,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456311348] [2025-02-08 08:15:31,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456311348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:31,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:31,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:15:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266414437] [2025-02-08 08:15:31,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:31,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:15:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:31,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:15:31,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:15:31,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:31,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:31,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:31,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:31,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:31,433 INFO L124 PetriNetUnfolderBase]: 2669/4121 cut-off events. [2025-02-08 08:15:31,433 INFO L125 PetriNetUnfolderBase]: For 3237/3237 co-relation queries the response was YES. [2025-02-08 08:15:31,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11202 conditions, 4121 events. 2669/4121 cut-off events. For 3237/3237 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20482 event pairs, 555 based on Foata normal form. 216/4326 useless extension candidates. Maximal degree in co-relation 11187. Up to 1494 conditions per place. [2025-02-08 08:15:31,448 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 85 selfloop transitions, 8 changer transitions 1/99 dead transitions. [2025-02-08 08:15:31,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 544 flow [2025-02-08 08:15:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:15:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:15:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-02-08 08:15:31,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6085106382978723 [2025-02-08 08:15:31,449 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 161 flow. Second operand 5 states and 143 transitions. [2025-02-08 08:15:31,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 544 flow [2025-02-08 08:15:31,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 534 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:15:31,453 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 201 flow [2025-02-08 08:15:31,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-02-08 08:15:31,453 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-02-08 08:15:31,453 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 201 flow [2025-02-08 08:15:31,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:31,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:31,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:31,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:15:31,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:31,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1671382398, now seen corresponding path program 1 times [2025-02-08 08:15:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:31,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403021747] [2025-02-08 08:15:31,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:15:31,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:15:31,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:31,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403021747] [2025-02-08 08:15:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403021747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:31,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:31,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:15:31,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496693059] [2025-02-08 08:15:31,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:31,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:31,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:31,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:31,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:31,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:31,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:31,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:31,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:31,981 INFO L124 PetriNetUnfolderBase]: 1759/2683 cut-off events. [2025-02-08 08:15:31,981 INFO L125 PetriNetUnfolderBase]: For 3145/3145 co-relation queries the response was YES. [2025-02-08 08:15:31,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7744 conditions, 2683 events. 1759/2683 cut-off events. For 3145/3145 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12358 event pairs, 499 based on Foata normal form. 68/2740 useless extension candidates. Maximal degree in co-relation 7727. Up to 1036 conditions per place. [2025-02-08 08:15:31,995 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 71 selfloop transitions, 11 changer transitions 1/88 dead transitions. [2025-02-08 08:15:31,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 503 flow [2025-02-08 08:15:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:15:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:15:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-02-08 08:15:31,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-02-08 08:15:31,996 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 201 flow. Second operand 6 states and 142 transitions. [2025-02-08 08:15:31,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 503 flow [2025-02-08 08:15:32,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 458 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-08 08:15:32,005 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 199 flow [2025-02-08 08:15:32,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2025-02-08 08:15:32,006 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-02-08 08:15:32,006 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 199 flow [2025-02-08 08:15:32,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:32,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:32,006 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, 1] [2025-02-08 08:15:32,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:15:32,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:32,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1316000253, now seen corresponding path program 1 times [2025-02-08 08:15:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590207252] [2025-02-08 08:15:32,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:32,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:32,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:32,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:32,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590207252] [2025-02-08 08:15:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590207252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:15:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485103728] [2025-02-08 08:15:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:32,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:32,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:32,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:32,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:32,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:32,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:32,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:32,625 INFO L124 PetriNetUnfolderBase]: 2311/3520 cut-off events. [2025-02-08 08:15:32,625 INFO L125 PetriNetUnfolderBase]: For 4202/4202 co-relation queries the response was YES. [2025-02-08 08:15:32,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9996 conditions, 3520 events. 2311/3520 cut-off events. For 4202/4202 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16967 event pairs, 399 based on Foata normal form. 8/3525 useless extension candidates. Maximal degree in co-relation 9980. Up to 2192 conditions per place. [2025-02-08 08:15:32,637 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 80 selfloop transitions, 12 changer transitions 14/111 dead transitions. [2025-02-08 08:15:32,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 677 flow [2025-02-08 08:15:32,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:15:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:15:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2025-02-08 08:15:32,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2025-02-08 08:15:32,639 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 199 flow. Second operand 7 states and 154 transitions. [2025-02-08 08:15:32,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 677 flow [2025-02-08 08:15:32,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 524 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-02-08 08:15:32,650 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 207 flow [2025-02-08 08:15:32,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-02-08 08:15:32,652 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-02-08 08:15:32,652 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 207 flow [2025-02-08 08:15:32,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:32,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:32,652 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, 1] [2025-02-08 08:15:32,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:15:32,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1681978087, now seen corresponding path program 2 times [2025-02-08 08:15:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107977229] [2025-02-08 08:15:32,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:15:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:32,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:32,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:32,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:15:32,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107977229] [2025-02-08 08:15:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107977229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:15:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808695924] [2025-02-08 08:15:32,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:32,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:32,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:32,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:32,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:32,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:32,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:32,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:32,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:33,231 INFO L124 PetriNetUnfolderBase]: 2909/4438 cut-off events. [2025-02-08 08:15:33,232 INFO L125 PetriNetUnfolderBase]: For 2084/2084 co-relation queries the response was YES. [2025-02-08 08:15:33,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11272 conditions, 4438 events. 2909/4438 cut-off events. For 2084/2084 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 22367 event pairs, 663 based on Foata normal form. 8/4443 useless extension candidates. Maximal degree in co-relation 11258. Up to 2100 conditions per place. [2025-02-08 08:15:33,247 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 51 selfloop transitions, 1 changer transitions 46/103 dead transitions. [2025-02-08 08:15:33,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 103 transitions, 558 flow [2025-02-08 08:15:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:15:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:15:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-02-08 08:15:33,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2025-02-08 08:15:33,248 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 207 flow. Second operand 6 states and 130 transitions. [2025-02-08 08:15:33,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 103 transitions, 558 flow [2025-02-08 08:15:33,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 552 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 08:15:33,252 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 154 flow [2025-02-08 08:15:33,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2025-02-08 08:15:33,253 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-02-08 08:15:33,253 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 154 flow [2025-02-08 08:15:33,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:33,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:33,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:33,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:15:33,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:33,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:33,255 INFO L85 PathProgramCache]: Analyzing trace with hash -314262467, now seen corresponding path program 3 times [2025-02-08 08:15:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:33,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323809994] [2025-02-08 08:15:33,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:15:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:33,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:33,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:33,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:15:33,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:33,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323809994] [2025-02-08 08:15:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323809994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:15:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88480982] [2025-02-08 08:15:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:33,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:33,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:33,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:33,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:33,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:33,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:33,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:33,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:33,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:33,797 INFO L124 PetriNetUnfolderBase]: 2049/3213 cut-off events. [2025-02-08 08:15:33,797 INFO L125 PetriNetUnfolderBase]: For 1470/1470 co-relation queries the response was YES. [2025-02-08 08:15:33,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8003 conditions, 3213 events. 2049/3213 cut-off events. For 1470/1470 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16116 event pairs, 471 based on Foata normal form. 8/3219 useless extension candidates. Maximal degree in co-relation 7987. Up to 1880 conditions per place. [2025-02-08 08:15:33,803 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 63 selfloop transitions, 9 changer transitions 19/96 dead transitions. [2025-02-08 08:15:33,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 500 flow [2025-02-08 08:15:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:15:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:15:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-02-08 08:15:33,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42249240121580545 [2025-02-08 08:15:33,804 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 154 flow. Second operand 7 states and 139 transitions. [2025-02-08 08:15:33,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 500 flow [2025-02-08 08:15:33,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 480 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:15:33,806 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 209 flow [2025-02-08 08:15:33,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2025-02-08 08:15:33,807 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2025-02-08 08:15:33,807 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 209 flow [2025-02-08 08:15:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:33,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:33,807 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, 1] [2025-02-08 08:15:33,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:15:33,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:33,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash 56962785, now seen corresponding path program 4 times [2025-02-08 08:15:33,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:33,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314676287] [2025-02-08 08:15:33,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:15:33,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:33,815 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 08:15:33,825 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:33,825 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:15:33,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314676287] [2025-02-08 08:15:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314676287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:33,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:33,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:15:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454399506] [2025-02-08 08:15:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:33,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:33,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:33,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:33,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:33,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:33,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:33,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:33,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:34,347 INFO L124 PetriNetUnfolderBase]: 2375/3763 cut-off events. [2025-02-08 08:15:34,348 INFO L125 PetriNetUnfolderBase]: For 2704/2704 co-relation queries the response was YES. [2025-02-08 08:15:34,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9948 conditions, 3763 events. 2375/3763 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19668 event pairs, 627 based on Foata normal form. 8/3769 useless extension candidates. Maximal degree in co-relation 9931. Up to 2086 conditions per place. [2025-02-08 08:15:34,359 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 45 selfloop transitions, 1 changer transitions 45/96 dead transitions. [2025-02-08 08:15:34,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 534 flow [2025-02-08 08:15:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:15:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:15:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-02-08 08:15:34,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45390070921985815 [2025-02-08 08:15:34,360 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 209 flow. Second operand 6 states and 128 transitions. [2025-02-08 08:15:34,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 534 flow [2025-02-08 08:15:34,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 522 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-08 08:15:34,363 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 154 flow [2025-02-08 08:15:34,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2025-02-08 08:15:34,363 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-02-08 08:15:34,363 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 154 flow [2025-02-08 08:15:34,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:34,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:34,363 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, 1] [2025-02-08 08:15:34,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:15:34,364 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:34,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -270581119, now seen corresponding path program 5 times [2025-02-08 08:15:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:34,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353174093] [2025-02-08 08:15:34,364 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:15:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:34,373 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:34,387 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:34,387 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:15:34,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:15:35,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353174093] [2025-02-08 08:15:35,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353174093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:35,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:35,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:15:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784159777] [2025-02-08 08:15:35,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:35,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:15:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:15:35,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:15:35,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:15:35,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:35,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 42 transitions, 154 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:35,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:35,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:35,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:36,161 INFO L124 PetriNetUnfolderBase]: 1177/1917 cut-off events. [2025-02-08 08:15:36,161 INFO L125 PetriNetUnfolderBase]: For 1300/1300 co-relation queries the response was YES. [2025-02-08 08:15:36,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 1917 events. 1177/1917 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8822 event pairs, 210 based on Foata normal form. 8/1924 useless extension candidates. Maximal degree in co-relation 4889. Up to 757 conditions per place. [2025-02-08 08:15:36,167 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 39 selfloop transitions, 4 changer transitions 47/95 dead transitions. [2025-02-08 08:15:36,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 508 flow [2025-02-08 08:15:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:15:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:15:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2025-02-08 08:15:36,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3553191489361702 [2025-02-08 08:15:36,168 INFO L175 Difference]: Start difference. First operand has 69 places, 42 transitions, 154 flow. Second operand 10 states and 167 transitions. [2025-02-08 08:15:36,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 508 flow [2025-02-08 08:15:36,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 468 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-02-08 08:15:36,171 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 151 flow [2025-02-08 08:15:36,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2025-02-08 08:15:36,172 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-02-08 08:15:36,172 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 151 flow [2025-02-08 08:15:36,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:36,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:36,172 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, 1] [2025-02-08 08:15:36,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:15:36,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -921770089, now seen corresponding path program 6 times [2025-02-08 08:15:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:15:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469731247] [2025-02-08 08:15:36,172 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:15:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:15:36,179 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:36,211 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:36,211 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:15:36,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:15:36,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:15:36,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:36,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:36,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:36,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:15:36,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:15:36,268 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:15:36,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:15:36,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:15:36,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:15:36,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:15:36,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:15:36,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:15:36,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:15:36,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:15:36,271 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:36,355 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:15:36,355 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:15:36,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:15:36 BasicIcfg [2025-02-08 08:15:36,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:15:36,359 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:15:36,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:15:36,359 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:15:36,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:15:23" (3/4) ... [2025-02-08 08:15:36,362 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:15:36,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:15:36,363 INFO L158 Benchmark]: Toolchain (without parser) took 13910.79ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 104.3MB in the beginning and 314.4MB in the end (delta: -210.1MB). Peak memory consumption was 826.1MB. Max. memory is 16.1GB. [2025-02-08 08:15:36,364 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 192.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:15:36,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.97ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 80.2MB in the end (delta: 23.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:15:36,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.47ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 77.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:15:36,364 INFO L158 Benchmark]: Boogie Preprocessor took 56.12ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 74.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:15:36,364 INFO L158 Benchmark]: IcfgBuilder took 704.83ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 84.3MB in the end (delta: -10.0MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2025-02-08 08:15:36,364 INFO L158 Benchmark]: TraceAbstraction took 12689.45ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 83.6MB in the beginning and 314.5MB in the end (delta: -230.9MB). Peak memory consumption was 794.5MB. Max. memory is 16.1GB. [2025-02-08 08:15:36,366 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 1.2GB. Free memory was 314.5MB in the beginning and 314.4MB in the end (delta: 160.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:15:36,368 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.62ms. Allocated memory is still 192.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.97ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 80.2MB in the end (delta: 23.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.47ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 77.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.12ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 74.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 704.83ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 84.3MB in the end (delta: -10.0MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12689.45ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 83.6MB in the beginning and 314.5MB in the end (delta: -230.9MB). Peak memory consumption was 794.5MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 1.2GB. Free memory was 314.5MB in the beginning and 314.4MB in the end (delta: 160.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-1, t261=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] 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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix010.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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. - UnprovableResult [Line: 856]: 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, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 770 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 764 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2403 IncrementalHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 2403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=11, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 2412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:15:36,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix010.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:15:38,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:15:38,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:15:38,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:15:38,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:15:38,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:15:38,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:15:38,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:15:38,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:15:38,605 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:15:38,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:15:38,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:15:38,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:15:38,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:15:38,605 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:15:38,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:15:38,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:15:38,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:15:38,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:15:38,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:15:38,607 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a [2025-02-08 08:15:38,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:15:38,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:15:38,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:15:38,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:15:38,882 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:15:38,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2025-02-08 08:15:40,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23fce66bf/d263a1df75e64231b80ebe91eb2f7988/FLAG0bb715642 [2025-02-08 08:15:40,272 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:15:40,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2025-02-08 08:15:40,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23fce66bf/d263a1df75e64231b80ebe91eb2f7988/FLAG0bb715642 [2025-02-08 08:15:40,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23fce66bf/d263a1df75e64231b80ebe91eb2f7988 [2025-02-08 08:15:40,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:15:40,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:15:40,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:15:40,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:15:40,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:15:40,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:40,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2e0827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40, skipping insertion in model container [2025-02-08 08:15:40,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:40,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:15:40,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:15:40,894 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:15:40,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:15:40,989 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:15:40,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40 WrapperNode [2025-02-08 08:15:40,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:15:40,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:15:40,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:15:40,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:15:40,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,036 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 146 [2025-02-08 08:15:41,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:15:41,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:15:41,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:15:41,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:15:41,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:15:41,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:15:41,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:15:41,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:15:41,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:15:41,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (1/1) ... [2025-02-08 08:15:41,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:15:41,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:41,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:15:41,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:15:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:15:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:15:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:15:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:15:41,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:15:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:15:41,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:15:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:15:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:15:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:15:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:15:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:15:41,165 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:15:41,311 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:15:41,314 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:15:41,667 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:15:41,667 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:15:41,898 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:15:41,898 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:15:41,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:15:41 BoogieIcfgContainer [2025-02-08 08:15:41,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:15:41,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:15:41,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:15:41,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:15:41,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:15:40" (1/3) ... [2025-02-08 08:15:41,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69aa8eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:15:41, skipping insertion in model container [2025-02-08 08:15:41,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:15:40" (2/3) ... [2025-02-08 08:15:41,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69aa8eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:15:41, skipping insertion in model container [2025-02-08 08:15:41,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:15:41" (3/3) ... [2025-02-08 08:15:41,906 INFO L128 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2025-02-08 08:15:41,916 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:15:41,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix010.opt.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:15:41,919 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:15:41,965 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:15:41,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2025-02-08 08:15:42,017 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2025-02-08 08:15:42,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:15:42,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-02-08 08:15:42,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2025-02-08 08:15:42,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2025-02-08 08:15:42,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:15:42,043 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;@ac90854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:15:42,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:15:42,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:15:42,051 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-02-08 08:15:42,051 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:15:42,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:42,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:42,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:42,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1147881979, now seen corresponding path program 1 times [2025-02-08 08:15:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992951468] [2025-02-08 08:15:42,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:42,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:42,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:15:42,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:15:42,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:15:42,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:42,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:42,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:15:42,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:42,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:42,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992951468] [2025-02-08 08:15:42,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992951468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:42,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:42,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:15:42,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306101708] [2025-02-08 08:15:42,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:42,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:15:42,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:42,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:15:42,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:15:42,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:42,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:42,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:42,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:42,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:43,389 INFO L124 PetriNetUnfolderBase]: 8459/12119 cut-off events. [2025-02-08 08:15:43,390 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-08 08:15:43,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24162 conditions, 12119 events. 8459/12119 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 67630 event pairs, 947 based on Foata normal form. 672/12772 useless extension candidates. Maximal degree in co-relation 24151. Up to 10393 conditions per place. [2025-02-08 08:15:43,466 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 50 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-02-08 08:15:43,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 239 flow [2025-02-08 08:15:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:15:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:15:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-08 08:15:43,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2025-02-08 08:15:43,480 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 89 transitions. [2025-02-08 08:15:43,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 239 flow [2025-02-08 08:15:43,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:15:43,487 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2025-02-08 08:15:43,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-08 08:15:43,493 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-02-08 08:15:43,493 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2025-02-08 08:15:43,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:43,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:43,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:43,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:15:43,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:43,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:43,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash 921435534, now seen corresponding path program 1 times [2025-02-08 08:15:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775924825] [2025-02-08 08:15:43,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:43,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:43,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:43,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:43,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:15:43,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:15:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:15:43,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:43,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:43,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:15:43,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:43,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:43,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:43,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775924825] [2025-02-08 08:15:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775924825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:43,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:15:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370105067] [2025-02-08 08:15:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:43,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:15:43,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:43,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:15:43,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:15:43,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:15:43,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:43,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:43,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:15:43,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:44,554 INFO L124 PetriNetUnfolderBase]: 7597/11527 cut-off events. [2025-02-08 08:15:44,554 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-02-08 08:15:44,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22803 conditions, 11527 events. 7597/11527 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 69429 event pairs, 7597 based on Foata normal form. 336/11778 useless extension candidates. Maximal degree in co-relation 22793. Up to 10730 conditions per place. [2025-02-08 08:15:44,608 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 30 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2025-02-08 08:15:44,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 150 flow [2025-02-08 08:15:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:15:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:15:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 08:15:44,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2025-02-08 08:15:44,610 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 60 transitions. [2025-02-08 08:15:44,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 150 flow [2025-02-08 08:15:44,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:15:44,612 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2025-02-08 08:15:44,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-08 08:15:44,613 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-08 08:15:44,613 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2025-02-08 08:15:44,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:44,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:44,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:44,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:15:44,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:44,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:44,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 921435656, now seen corresponding path program 1 times [2025-02-08 08:15:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:44,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668526906] [2025-02-08 08:15:44,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:44,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:44,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:44,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:15:44,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:15:44,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:15:44,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:44,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:44,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:15:44,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:44,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:44,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668526906] [2025-02-08 08:15:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668526906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:44,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:44,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:15:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027132125] [2025-02-08 08:15:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:44,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:15:44,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:44,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:15:44,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:15:44,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:44,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:44,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:44,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:44,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:45,503 INFO L124 PetriNetUnfolderBase]: 5221/8293 cut-off events. [2025-02-08 08:15:45,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:15:45,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16041 conditions, 8293 events. 5221/8293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 50717 event pairs, 951 based on Foata normal form. 336/8618 useless extension candidates. Maximal degree in co-relation 16035. Up to 4309 conditions per place. [2025-02-08 08:15:45,540 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 64 selfloop transitions, 5 changer transitions 1/76 dead transitions. [2025-02-08 08:15:45,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 304 flow [2025-02-08 08:15:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:15:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:15:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-08 08:15:45,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-02-08 08:15:45,543 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 4 states and 112 transitions. [2025-02-08 08:15:45,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 304 flow [2025-02-08 08:15:45,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:15:45,545 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2025-02-08 08:15:45,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-08 08:15:45,547 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-02-08 08:15:45,547 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2025-02-08 08:15:45,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:45,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:45,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:45,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:15:45,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:45,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:45,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash -709938905, now seen corresponding path program 1 times [2025-02-08 08:15:45,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:45,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289100867] [2025-02-08 08:15:45,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:45,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:45,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:45,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:45,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:15:45,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:15:45,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:15:45,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:45,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:45,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:15:45,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:45,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-02-08 08:15:45,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:45,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289100867] [2025-02-08 08:15:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289100867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:45,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:45,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:15:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028927374] [2025-02-08 08:15:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:45,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:15:45,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:45,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:15:45,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:15:45,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:45,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:45,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:45,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:45,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:46,286 INFO L124 PetriNetUnfolderBase]: 2789/4409 cut-off events. [2025-02-08 08:15:46,286 INFO L125 PetriNetUnfolderBase]: For 874/874 co-relation queries the response was YES. [2025-02-08 08:15:46,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9924 conditions, 4409 events. 2789/4409 cut-off events. For 874/874 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 22982 event pairs, 621 based on Foata normal form. 216/4614 useless extension candidates. Maximal degree in co-relation 9915. Up to 1494 conditions per place. [2025-02-08 08:15:46,307 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 82 selfloop transitions, 8 changer transitions 1/97 dead transitions. [2025-02-08 08:15:46,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 432 flow [2025-02-08 08:15:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:15:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:15:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-02-08 08:15:46,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6085106382978723 [2025-02-08 08:15:46,312 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 143 transitions. [2025-02-08 08:15:46,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 432 flow [2025-02-08 08:15:46,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:15:46,317 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2025-02-08 08:15:46,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-02-08 08:15:46,319 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-02-08 08:15:46,319 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2025-02-08 08:15:46,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:46,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:46,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:15:46,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:15:46,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:46,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:46,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash -996460697, now seen corresponding path program 1 times [2025-02-08 08:15:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218948928] [2025-02-08 08:15:46,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:46,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:46,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:46,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:46,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:15:46,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:15:46,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:15:46,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:46,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:46,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:15:46,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:46,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:46,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218948928] [2025-02-08 08:15:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218948928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:46,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:46,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:15:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220806880] [2025-02-08 08:15:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:46,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:15:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:46,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:15:46,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:15:46,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:46,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:46,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:46,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:46,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:47,040 INFO L124 PetriNetUnfolderBase]: 1759/2691 cut-off events. [2025-02-08 08:15:47,040 INFO L125 PetriNetUnfolderBase]: For 1498/1498 co-relation queries the response was YES. [2025-02-08 08:15:47,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 2691 events. 1759/2691 cut-off events. For 1498/1498 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12404 event pairs, 565 based on Foata normal form. 68/2748 useless extension candidates. Maximal degree in co-relation 6581. Up to 1036 conditions per place. [2025-02-08 08:15:47,050 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 68 selfloop transitions, 11 changer transitions 1/86 dead transitions. [2025-02-08 08:15:47,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 411 flow [2025-02-08 08:15:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:15:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:15:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-02-08 08:15:47,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-02-08 08:15:47,052 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 142 transitions. [2025-02-08 08:15:47,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 411 flow [2025-02-08 08:15:47,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 386 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:15:47,063 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2025-02-08 08:15:47,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-02-08 08:15:47,064 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-02-08 08:15:47,064 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2025-02-08 08:15:47,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:47,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:47,065 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, 1] [2025-02-08 08:15:47,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:15:47,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:47,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:47,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1344688907, now seen corresponding path program 1 times [2025-02-08 08:15:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:47,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287131796] [2025-02-08 08:15:47,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:15:47,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:47,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:47,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:47,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:15:47,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:47,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:47,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:47,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:15:47,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:47,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:47,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287131796] [2025-02-08 08:15:47,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287131796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:47,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:47,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:15:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711397724] [2025-02-08 08:15:47,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:47,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:15:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:47,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:15:47,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:15:47,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:47,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:47,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:47,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:47,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:47,977 INFO L124 PetriNetUnfolderBase]: 2555/3911 cut-off events. [2025-02-08 08:15:47,978 INFO L125 PetriNetUnfolderBase]: For 2488/2488 co-relation queries the response was YES. [2025-02-08 08:15:47,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9765 conditions, 3911 events. 2555/3911 cut-off events. For 2488/2488 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 19280 event pairs, 275 based on Foata normal form. 8/3912 useless extension candidates. Maximal degree in co-relation 9753. Up to 1633 conditions per place. [2025-02-08 08:15:47,990 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 58 selfloop transitions, 7 changer transitions 51/122 dead transitions. [2025-02-08 08:15:47,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 122 transitions, 653 flow [2025-02-08 08:15:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:15:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:15:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2025-02-08 08:15:47,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2025-02-08 08:15:47,992 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 9 states and 201 transitions. [2025-02-08 08:15:47,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 122 transitions, 653 flow [2025-02-08 08:15:48,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 122 transitions, 536 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-08 08:15:48,006 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 157 flow [2025-02-08 08:15:48,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=157, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-02-08 08:15:48,007 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2025-02-08 08:15:48,007 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 157 flow [2025-02-08 08:15:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:48,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:48,007 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, 1] [2025-02-08 08:15:48,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:15:48,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:48,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:48,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash -683824231, now seen corresponding path program 2 times [2025-02-08 08:15:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119808629] [2025-02-08 08:15:48,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:15:48,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:48,211 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:48,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:15:48,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:48,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:48,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:15:48,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:48,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:15:48,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:48,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:48,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119808629] [2025-02-08 08:15:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119808629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:48,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:15:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372483094] [2025-02-08 08:15:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:48,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:15:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:48,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:15:48,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:15:48,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:48,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 157 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:48,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:48,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:48,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:48,856 INFO L124 PetriNetUnfolderBase]: 2231/3456 cut-off events. [2025-02-08 08:15:48,856 INFO L125 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2025-02-08 08:15:48,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8354 conditions, 3456 events. 2231/3456 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16887 event pairs, 351 based on Foata normal form. 8/3461 useless extension candidates. Maximal degree in co-relation 8340. Up to 1633 conditions per place. [2025-02-08 08:15:48,868 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 62 selfloop transitions, 10 changer transitions 47/125 dead transitions. [2025-02-08 08:15:48,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 636 flow [2025-02-08 08:15:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:15:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:15:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2025-02-08 08:15:48,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47044917257683216 [2025-02-08 08:15:48,870 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 157 flow. Second operand 9 states and 199 transitions. [2025-02-08 08:15:48,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 636 flow [2025-02-08 08:15:48,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 125 transitions, 594 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-08 08:15:48,873 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 197 flow [2025-02-08 08:15:48,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2025-02-08 08:15:48,874 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-02-08 08:15:48,874 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 197 flow [2025-02-08 08:15:48,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:48,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:48,874 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, 1] [2025-02-08 08:15:48,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 08:15:49,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:49,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1355206933, now seen corresponding path program 3 times [2025-02-08 08:15:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358397638] [2025-02-08 08:15:49,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:15:49,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:49,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:49,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:49,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:15:49,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:49,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:49,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:15:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:49,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 08:15:49,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:49,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:49,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:49,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358397638] [2025-02-08 08:15:49,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358397638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:49,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:49,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:15:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471771884] [2025-02-08 08:15:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:49,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:15:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:49,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:15:49,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:15:49,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:49,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 197 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:49,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:49,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:49,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:50,386 INFO L124 PetriNetUnfolderBase]: 1847/2901 cut-off events. [2025-02-08 08:15:50,386 INFO L125 PetriNetUnfolderBase]: For 1021/1024 co-relation queries the response was YES. [2025-02-08 08:15:50,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7491 conditions, 2901 events. 1847/2901 cut-off events. For 1021/1024 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 13792 event pairs, 337 based on Foata normal form. 8/2900 useless extension candidates. Maximal degree in co-relation 7475. Up to 1493 conditions per place. [2025-02-08 08:15:50,398 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 87 selfloop transitions, 32 changer transitions 37/162 dead transitions. [2025-02-08 08:15:50,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 162 transitions, 926 flow [2025-02-08 08:15:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:15:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 08:15:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 268 transitions. [2025-02-08 08:15:50,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4386252045826514 [2025-02-08 08:15:50,404 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 197 flow. Second operand 13 states and 268 transitions. [2025-02-08 08:15:50,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 162 transitions, 926 flow [2025-02-08 08:15:50,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 162 transitions, 884 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:15:50,410 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 405 flow [2025-02-08 08:15:50,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=405, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2025-02-08 08:15:50,410 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-02-08 08:15:50,410 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 405 flow [2025-02-08 08:15:50,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:50,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:50,411 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, 1] [2025-02-08 08:15:50,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:15:50,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:50,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 751646245, now seen corresponding path program 4 times [2025-02-08 08:15:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330663994] [2025-02-08 08:15:50,613 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:15:50,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:50,617 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:50,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:15:50,668 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 08:15:50,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 33 statements. [2025-02-08 08:15:50,682 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:15:50,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:50,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:15:50,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:50,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:50,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330663994] [2025-02-08 08:15:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330663994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:50,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:50,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:15:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384835557] [2025-02-08 08:15:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:50,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:15:50,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:50,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:15:50,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:15:50,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:50,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:50,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:50,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:50,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:51,100 INFO L124 PetriNetUnfolderBase]: 1883/2964 cut-off events. [2025-02-08 08:15:51,100 INFO L125 PetriNetUnfolderBase]: For 1790/1790 co-relation queries the response was YES. [2025-02-08 08:15:51,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8200 conditions, 2964 events. 1883/2964 cut-off events. For 1790/1790 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14489 event pairs, 475 based on Foata normal form. 8/2969 useless extension candidates. Maximal degree in co-relation 8180. Up to 2034 conditions per place. [2025-02-08 08:15:51,110 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 70 selfloop transitions, 2 changer transitions 55/133 dead transitions. [2025-02-08 08:15:51,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 133 transitions, 853 flow [2025-02-08 08:15:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:15:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:15:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-02-08 08:15:51,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45288753799392095 [2025-02-08 08:15:51,112 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 405 flow. Second operand 7 states and 149 transitions. [2025-02-08 08:15:51,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 133 transitions, 853 flow [2025-02-08 08:15:51,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 133 transitions, 833 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 08:15:51,116 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 323 flow [2025-02-08 08:15:51,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2025-02-08 08:15:51,117 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-02-08 08:15:51,117 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 323 flow [2025-02-08 08:15:51,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:51,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:51,117 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, 1] [2025-02-08 08:15:51,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:15:51,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:51,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:51,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash 46734385, now seen corresponding path program 5 times [2025-02-08 08:15:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634890994] [2025-02-08 08:15:51,320 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:15:51,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:51,322 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:51,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:15:51,369 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:51,389 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:51,389 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:15:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:51,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:15:51,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:51,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:51,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634890994] [2025-02-08 08:15:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634890994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:15:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119848710] [2025-02-08 08:15:51,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:15:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:51,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:15:51,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:15:51,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:51,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:51,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:51,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:51,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:51,839 INFO L124 PetriNetUnfolderBase]: 1605/2597 cut-off events. [2025-02-08 08:15:51,839 INFO L125 PetriNetUnfolderBase]: For 2143/2146 co-relation queries the response was YES. [2025-02-08 08:15:51,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7077 conditions, 2597 events. 1605/2597 cut-off events. For 2143/2146 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12600 event pairs, 349 based on Foata normal form. 8/2598 useless extension candidates. Maximal degree in co-relation 7055. Up to 1690 conditions per place. [2025-02-08 08:15:51,848 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 53 selfloop transitions, 2 changer transitions 53/114 dead transitions. [2025-02-08 08:15:51,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 705 flow [2025-02-08 08:15:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:15:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:15:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-02-08 08:15:51,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2025-02-08 08:15:51,850 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 323 flow. Second operand 7 states and 147 transitions. [2025-02-08 08:15:51,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 705 flow [2025-02-08 08:15:51,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 673 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-08 08:15:51,855 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 241 flow [2025-02-08 08:15:51,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2025-02-08 08:15:51,855 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-02-08 08:15:51,855 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 241 flow [2025-02-08 08:15:51,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:51,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:51,856 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, 1] [2025-02-08 08:15:51,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 08:15:52,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:52,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:52,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2145054395, now seen corresponding path program 6 times [2025-02-08 08:15:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:52,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041612638] [2025-02-08 08:15:52,061 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:15:52,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:52,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:52,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:52,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:15:52,118 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:52,136 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:52,136 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:15:52,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:15:52,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:15:52,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:15:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:15:52,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:15:52,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:15:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041612638] [2025-02-08 08:15:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041612638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:15:52,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:15:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:15:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688426876] [2025-02-08 08:15:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:15:52,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:15:52,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:15:52,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:15:52,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:15:52,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:15:52,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 53 transitions, 241 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:52,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:15:52,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:15:52,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:15:53,229 INFO L124 PetriNetUnfolderBase]: 1199/1997 cut-off events. [2025-02-08 08:15:53,229 INFO L125 PetriNetUnfolderBase]: For 1404/1410 co-relation queries the response was YES. [2025-02-08 08:15:53,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5367 conditions, 1997 events. 1199/1997 cut-off events. For 1404/1410 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9061 event pairs, 207 based on Foata normal form. 8/1996 useless extension candidates. Maximal degree in co-relation 5351. Up to 814 conditions per place. [2025-02-08 08:15:53,235 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 49 selfloop transitions, 6 changer transitions 53/114 dead transitions. [2025-02-08 08:15:53,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 114 transitions, 661 flow [2025-02-08 08:15:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:15:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:15:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-02-08 08:15:53,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3849129593810445 [2025-02-08 08:15:53,237 INFO L175 Difference]: Start difference. First operand has 78 places, 53 transitions, 241 flow. Second operand 11 states and 199 transitions. [2025-02-08 08:15:53,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 114 transitions, 661 flow [2025-02-08 08:15:53,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 618 flow, removed 11 selfloop flow, removed 9 redundant places. [2025-02-08 08:15:53,240 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 213 flow [2025-02-08 08:15:53,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=213, PETRI_PLACES=78, PETRI_TRANSITIONS=49} [2025-02-08 08:15:53,241 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-02-08 08:15:53,241 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 49 transitions, 213 flow [2025-02-08 08:15:53,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:15:53,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:15:53,241 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, 1] [2025-02-08 08:15:53,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 08:15:53,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:53,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:15:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:15:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 280594481, now seen corresponding path program 7 times [2025-02-08 08:15:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:15:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196220841] [2025-02-08 08:15:53,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:15:53,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:15:53,444 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:15:53,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 08:15:53,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:53,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:53,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:53,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:15:53,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:15:53,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:15:53,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:15:53,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:15:53,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:15:53,575 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:15:53,575 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:15:53,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:15:53,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:15:53,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:15:53,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:15:53,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:15:53,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:15:53,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:15:53,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 08:15:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:15:53,779 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2025-02-08 08:15:53,851 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:15:53,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:15:53,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:15:53 BasicIcfg [2025-02-08 08:15:53,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:15:53,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:15:53,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:15:53,855 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:15:53,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:15:41" (3/4) ... [2025-02-08 08:15:53,870 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:15:53,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:15:53,872 INFO L158 Benchmark]: Toolchain (without parser) took 13263.09ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 91.7MB in the beginning and 894.9MB in the end (delta: -803.2MB). Peak memory consumption was 763.1MB. Max. memory is 16.1GB. [2025-02-08 08:15:53,872 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:15:53,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.13ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 67.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:15:53,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.50ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 65.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:15:53,872 INFO L158 Benchmark]: Boogie Preprocessor took 51.18ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:15:53,872 INFO L158 Benchmark]: IcfgBuilder took 809.21ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 85.4MB in the end (delta: -23.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-02-08 08:15:53,876 INFO L158 Benchmark]: TraceAbstraction took 11953.45ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 85.4MB in the beginning and 281.1MB in the end (delta: -195.7MB). Peak memory consumption was 747.7MB. Max. memory is 16.1GB. [2025-02-08 08:15:53,877 INFO L158 Benchmark]: Witness Printer took 16.61ms. Allocated memory is still 1.1GB. Free memory was 281.1MB in the beginning and 894.9MB in the end (delta: -613.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:15:53,878 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.22ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.13ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 67.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.50ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 65.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.18ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 809.21ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 85.4MB in the end (delta: -23.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11953.45ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 85.4MB in the beginning and 281.1MB in the end (delta: -195.7MB). Peak memory consumption was 747.7MB. Max. memory is 16.1GB. * Witness Printer took 16.61ms. Allocated memory is still 1.1GB. Free memory was 281.1MB in the beginning and 894.9MB in the end (delta: -613.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-1, t261=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L759] 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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] 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, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-1, t261=0, t262=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix010.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 769 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 756 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3238 IncrementalHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 3 mSDtfsCounter, 3238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=8, InterpolantAutomatonStates: 77, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1629 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1261 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:15:53,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample