./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:43:45,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:43:45,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:43:45,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:43:45,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:43:45,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:43:45,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:43:45,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:43:45,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:43:45,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:43:45,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:43:45,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:43:45,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:43:45,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:43:45,290 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:43:45,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:43:45,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:43:45,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:43:45,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:43:45,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:43:45,291 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:43:45,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:43:45,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:43:45,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:43:45,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:43:45,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:43:45,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:43:45,293 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2025-01-10 00:43:45,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:43:45,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:43:45,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:43:45,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:43:45,599 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:43:45,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2025-01-10 00:43:46,957 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/531df815d/d0bfbfc9c0b84226aec584ec985f9569/FLAG7bbb83003 [2025-01-10 00:43:47,349 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:43:47,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2025-01-10 00:43:47,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/531df815d/d0bfbfc9c0b84226aec584ec985f9569/FLAG7bbb83003 [2025-01-10 00:43:47,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/531df815d/d0bfbfc9c0b84226aec584ec985f9569 [2025-01-10 00:43:47,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:43:47,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:43:47,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:43:47,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:43:47,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:43:47,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4c17dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47, skipping insertion in model container [2025-01-10 00:43:47,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:43:47,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:43:47,791 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:43:47,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:43:47,914 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:43:47,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47 WrapperNode [2025-01-10 00:43:47,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:43:47,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:43:47,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:43:47,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:43:47,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,969 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2025-01-10 00:43:47,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:43:47,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:43:47,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:43:47,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:43:47,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:43:47,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:47,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:48,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:48,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:48,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:48,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:48,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:48,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:43:48,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:43:48,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:43:48,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:43:48,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (1/1) ... [2025-01-10 00:43:48,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:43:48,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:48,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:43:48,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:43:48,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:43:48,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:43:48,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:43:48,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:43:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:43:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:43:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:43:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:43:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:43:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:43:48,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:43:48,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:43:48,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:43:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:43:48,084 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:43:48,221 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:43:48,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:43:48,523 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:43:48,523 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:43:48,769 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:43:48,770 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:43:48,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:43:48 BoogieIcfgContainer [2025-01-10 00:43:48,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:43:48,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:43:48,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:43:48,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:43:48,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:43:47" (1/3) ... [2025-01-10 00:43:48,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31878352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:43:48, skipping insertion in model container [2025-01-10 00:43:48,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:47" (2/3) ... [2025-01-10 00:43:48,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31878352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:43:48, skipping insertion in model container [2025-01-10 00:43:48,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:43:48" (3/3) ... [2025-01-10 00:43:48,782 INFO L128 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2025-01-10 00:43:48,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:43:48,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix021_tso.oepc.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:43:48,798 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:43:48,865 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:43:48,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2025-01-10 00:43:48,942 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-01-10 00:43:48,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:43:48,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-01-10 00:43:48,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2025-01-10 00:43:48,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2025-01-10 00:43:48,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:43:48,971 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;@26bc7638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:43:48,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:43:48,982 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:43:48,982 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-01-10 00:43:48,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:43:48,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:48,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:48,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:48,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 442823437, now seen corresponding path program 1 times [2025-01-10 00:43:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:49,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285867353] [2025-01-10 00:43:49,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:49,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:43:49,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:43:49,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:49,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:49,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:49,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285867353] [2025-01-10 00:43:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285867353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:49,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:49,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:43:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997609604] [2025-01-10 00:43:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:49,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:43:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:49,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:43:49,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:43:49,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2025-01-10 00:43:49,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:49,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:49,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2025-01-10 00:43:49,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:50,233 INFO L124 PetriNetUnfolderBase]: 1711/2911 cut-off events. [2025-01-10 00:43:50,234 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:43:50,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2911 events. 1711/2911 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21030 event pairs, 310 based on Foata normal form. 144/3008 useless extension candidates. Maximal degree in co-relation 5395. Up to 1924 conditions per place. [2025-01-10 00:43:50,265 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 35 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-01-10 00:43:50,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 215 flow [2025-01-10 00:43:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:43:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:43:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-01-10 00:43:50,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2025-01-10 00:43:50,298 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 122 transitions. [2025-01-10 00:43:50,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 215 flow [2025-01-10 00:43:50,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:43:50,308 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2025-01-10 00:43:50,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-01-10 00:43:50,315 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-01-10 00:43:50,315 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2025-01-10 00:43:50,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:50,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:50,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:43:50,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1796986954, now seen corresponding path program 1 times [2025-01-10 00:43:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:50,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368929418] [2025-01-10 00:43:50,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:50,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:50,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:43:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:43:50,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:50,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:50,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-01-10 00:43:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:50,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368929418] [2025-01-10 00:43:50,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368929418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:50,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:50,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:43:50,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761300047] [2025-01-10 00:43:50,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:50,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:43:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:50,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:43:50,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:43:50,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2025-01-10 00:43:50,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:50,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:50,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2025-01-10 00:43:50,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:50,964 INFO L124 PetriNetUnfolderBase]: 1525/2605 cut-off events. [2025-01-10 00:43:50,965 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 00:43:50,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4997 conditions, 2605 events. 1525/2605 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18905 event pairs, 1525 based on Foata normal form. 72/2558 useless extension candidates. Maximal degree in co-relation 4987. Up to 2166 conditions per place. [2025-01-10 00:43:50,983 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 21 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2025-01-10 00:43:50,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 146 flow [2025-01-10 00:43:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:43:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:43:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-01-10 00:43:50,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 00:43:50,987 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 99 transitions. [2025-01-10 00:43:50,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 146 flow [2025-01-10 00:43:50,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:43:50,991 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2025-01-10 00:43:50,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-01-10 00:43:50,992 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-01-10 00:43:50,992 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2025-01-10 00:43:50,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:50,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:50,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:50,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:43:50,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:50,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1796985732, now seen corresponding path program 1 times [2025-01-10 00:43:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767640827] [2025-01-10 00:43:50,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:51,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:43:51,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:43:51,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:51,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767640827] [2025-01-10 00:43:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767640827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:51,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:51,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:43:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516538032] [2025-01-10 00:43:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:51,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:43:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:51,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:43:51,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:43:51,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:43:51,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:51,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:51,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:43:51,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:52,424 INFO L124 PetriNetUnfolderBase]: 5957/8915 cut-off events. [2025-01-10 00:43:52,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:43:52,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17267 conditions, 8915 events. 5957/8915 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 60584 event pairs, 663 based on Foata normal form. 240/9089 useless extension candidates. Maximal degree in co-relation 17261. Up to 5353 conditions per place. [2025-01-10 00:43:52,489 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 48 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2025-01-10 00:43:52,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 268 flow [2025-01-10 00:43:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:43:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:43:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 00:43:52,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-01-10 00:43:52,494 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 141 transitions. [2025-01-10 00:43:52,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 268 flow [2025-01-10 00:43:52,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:43:52,498 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow [2025-01-10 00:43:52,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2025-01-10 00:43:52,500 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2025-01-10 00:43:52,500 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow [2025-01-10 00:43:52,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:52,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:52,501 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-01-10 00:43:52,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:43:52,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:52,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1906631303, now seen corresponding path program 1 times [2025-01-10 00:43:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:52,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419783671] [2025-01-10 00:43:52,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:52,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:52,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:43:52,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:43:52,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:52,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:52,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419783671] [2025-01-10 00:43:52,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419783671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:43:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644039741] [2025-01-10 00:43:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:52,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:43:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:52,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:43:52,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:43:52,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:43:52,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:52,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:52,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:43:52,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:53,650 INFO L124 PetriNetUnfolderBase]: 4789/7231 cut-off events. [2025-01-10 00:43:53,650 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2025-01-10 00:43:53,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16550 conditions, 7231 events. 4789/7231 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 47515 event pairs, 249 based on Foata normal form. 228/7412 useless extension candidates. Maximal degree in co-relation 16541. Up to 3841 conditions per place. [2025-01-10 00:43:53,707 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 61 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2025-01-10 00:43:53,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 392 flow [2025-01-10 00:43:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:43:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:43:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-01-10 00:43:53,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2025-01-10 00:43:53,710 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 179 transitions. [2025-01-10 00:43:53,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 392 flow [2025-01-10 00:43:53,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 381 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:43:53,717 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow [2025-01-10 00:43:53,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-01-10 00:43:53,718 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2025-01-10 00:43:53,718 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow [2025-01-10 00:43:53,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:53,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:53,719 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] [2025-01-10 00:43:53,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:43:53,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:53,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 242161506, now seen corresponding path program 1 times [2025-01-10 00:43:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398052338] [2025-01-10 00:43:53,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:53,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:43:53,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:43:53,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:53,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398052338] [2025-01-10 00:43:54,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398052338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:54,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:43:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792244710] [2025-01-10 00:43:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:54,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:43:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:54,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:43:54,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:43:54,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:43:54,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:54,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:54,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:43:54,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:54,601 INFO L124 PetriNetUnfolderBase]: 3029/4587 cut-off events. [2025-01-10 00:43:54,602 INFO L125 PetriNetUnfolderBase]: For 3551/3551 co-relation queries the response was YES. [2025-01-10 00:43:54,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11822 conditions, 4587 events. 3029/4587 cut-off events. For 3551/3551 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 26726 event pairs, 115 based on Foata normal form. 172/4722 useless extension candidates. Maximal degree in co-relation 11811. Up to 1633 conditions per place. [2025-01-10 00:43:54,622 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 72 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2025-01-10 00:43:54,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 515 flow [2025-01-10 00:43:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:43:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:43:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-01-10 00:43:54,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2025-01-10 00:43:54,624 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 215 transitions. [2025-01-10 00:43:54,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 515 flow [2025-01-10 00:43:54,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 485 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:43:54,635 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow [2025-01-10 00:43:54,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2025-01-10 00:43:54,636 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2025-01-10 00:43:54,636 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow [2025-01-10 00:43:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:54,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:54,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:54,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:43:54,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:54,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1918409577, now seen corresponding path program 1 times [2025-01-10 00:43:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:54,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657003356] [2025-01-10 00:43:54,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:54,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:54,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:43:54,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:43:54,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:54,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657003356] [2025-01-10 00:43:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657003356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:54,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:43:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345237586] [2025-01-10 00:43:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:54,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:43:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:54,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:43:54,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:43:54,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:43:54,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:54,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:54,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:43:54,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:55,379 INFO L124 PetriNetUnfolderBase]: 1857/2747 cut-off events. [2025-01-10 00:43:55,379 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2025-01-10 00:43:55,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7927 conditions, 2747 events. 1857/2747 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13998 event pairs, 77 based on Foata normal form. 80/2791 useless extension candidates. Maximal degree in co-relation 7915. Up to 828 conditions per place. [2025-01-10 00:43:55,397 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 65 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2025-01-10 00:43:55,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 513 flow [2025-01-10 00:43:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:43:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:43:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2025-01-10 00:43:55,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164 [2025-01-10 00:43:55,399 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 233 transitions. [2025-01-10 00:43:55,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 513 flow [2025-01-10 00:43:55,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 467 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 00:43:55,415 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow [2025-01-10 00:43:55,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-01-10 00:43:55,416 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2025-01-10 00:43:55,416 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow [2025-01-10 00:43:55,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:55,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:55,416 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, 1, 1, 1, 1, 1] [2025-01-10 00:43:55,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:43:55,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:55,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash -834859100, now seen corresponding path program 1 times [2025-01-10 00:43:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083085123] [2025-01-10 00:43:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:55,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:43:55,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:43:55,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083085123] [2025-01-10 00:43:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083085123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:56,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:56,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:43:56,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335397428] [2025-01-10 00:43:56,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:56,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:43:56,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:56,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:43:56,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:43:56,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-01-10 00:43:56,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:56,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:56,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-01-10 00:43:56,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:57,755 INFO L124 PetriNetUnfolderBase]: 6634/10513 cut-off events. [2025-01-10 00:43:57,756 INFO L125 PetriNetUnfolderBase]: For 4561/4859 co-relation queries the response was YES. [2025-01-10 00:43:57,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24433 conditions, 10513 events. 6634/10513 cut-off events. For 4561/4859 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 70320 event pairs, 956 based on Foata normal form. 16/10101 useless extension candidates. Maximal degree in co-relation 24420. Up to 4195 conditions per place. [2025-01-10 00:43:57,817 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 46 selfloop transitions, 13 changer transitions 40/126 dead transitions. [2025-01-10 00:43:57,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 623 flow [2025-01-10 00:43:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:43:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:43:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 260 transitions. [2025-01-10 00:43:57,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2025-01-10 00:43:57,819 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 8 states and 260 transitions. [2025-01-10 00:43:57,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 623 flow [2025-01-10 00:43:57,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 126 transitions, 507 flow, removed 27 selfloop flow, removed 10 redundant places. [2025-01-10 00:43:57,902 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 252 flow [2025-01-10 00:43:57,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-01-10 00:43:57,904 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2025-01-10 00:43:57,904 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 252 flow [2025-01-10 00:43:57,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:57,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:57,905 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, 1, 1, 1, 1, 1] [2025-01-10 00:43:57,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:43:57,905 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:57,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1853785946, now seen corresponding path program 2 times [2025-01-10 00:43:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:57,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426423785] [2025-01-10 00:43:57,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:43:57,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:57,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:43:57,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:43:57,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:43:57,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:58,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:43:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426423785] [2025-01-10 00:43:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426423785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:43:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909599450] [2025-01-10 00:43:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:43:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:43:58,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:43:58,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:43:58,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-01-10 00:43:58,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:58,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:58,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-01-10 00:43:58,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:59,569 INFO L124 PetriNetUnfolderBase]: 6856/11351 cut-off events. [2025-01-10 00:43:59,569 INFO L125 PetriNetUnfolderBase]: For 5061/5185 co-relation queries the response was YES. [2025-01-10 00:43:59,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28534 conditions, 11351 events. 6856/11351 cut-off events. For 5061/5185 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 84306 event pairs, 768 based on Foata normal form. 16/10655 useless extension candidates. Maximal degree in co-relation 28520. Up to 3132 conditions per place. [2025-01-10 00:43:59,652 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 45 selfloop transitions, 12 changer transitions 42/126 dead transitions. [2025-01-10 00:43:59,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 668 flow [2025-01-10 00:43:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:43:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:43:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2025-01-10 00:43:59,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5810185185185185 [2025-01-10 00:43:59,655 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 252 flow. Second operand 8 states and 251 transitions. [2025-01-10 00:43:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 668 flow [2025-01-10 00:43:59,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 637 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:43:59,661 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 268 flow [2025-01-10 00:43:59,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2025-01-10 00:43:59,662 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2025-01-10 00:43:59,662 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 268 flow [2025-01-10 00:43:59,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:59,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:59,663 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, 1, 1, 1, 1, 1] [2025-01-10 00:43:59,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:43:59,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1362141380, now seen corresponding path program 3 times [2025-01-10 00:43:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:59,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305025153] [2025-01-10 00:43:59,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:43:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:59,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:43:59,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:43:59,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:43:59,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:00,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:44:00,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305025153] [2025-01-10 00:44:00,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305025153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:00,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:00,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:44:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684397566] [2025-01-10 00:44:00,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:00,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:44:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:44:00,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:44:00,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:44:00,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:44:00,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:00,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:00,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:44:00,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:00,878 INFO L124 PetriNetUnfolderBase]: 4171/7492 cut-off events. [2025-01-10 00:44:00,879 INFO L125 PetriNetUnfolderBase]: For 4946/5096 co-relation queries the response was YES. [2025-01-10 00:44:00,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18482 conditions, 7492 events. 4171/7492 cut-off events. For 4946/5096 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 56245 event pairs, 1196 based on Foata normal form. 16/7038 useless extension candidates. Maximal degree in co-relation 18465. Up to 3301 conditions per place. [2025-01-10 00:44:00,917 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 35 selfloop transitions, 5 changer transitions 28/96 dead transitions. [2025-01-10 00:44:00,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 498 flow [2025-01-10 00:44:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:44:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:44:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2025-01-10 00:44:00,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2025-01-10 00:44:00,918 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 268 flow. Second operand 6 states and 188 transitions. [2025-01-10 00:44:00,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 498 flow [2025-01-10 00:44:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 488 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 00:44:00,924 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 249 flow [2025-01-10 00:44:00,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-01-10 00:44:00,926 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2025-01-10 00:44:00,927 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 249 flow [2025-01-10 00:44:00,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:00,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:00,928 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:00,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:44:00,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1602377230, now seen corresponding path program 4 times [2025-01-10 00:44:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:44:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637449510] [2025-01-10 00:44:00,929 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:44:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:44:00,945 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-10 00:44:01,016 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:01,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:44:01,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:03,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:44:03,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637449510] [2025-01-10 00:44:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637449510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:03,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:03,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:44:03,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740022287] [2025-01-10 00:44:03,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:03,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:44:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:44:03,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:44:03,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:44:03,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2025-01-10 00:44:03,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 249 flow. Second operand has 11 states, 11 states have (on average 26.727272727272727) internal successors, (294), 11 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:03,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:03,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2025-01-10 00:44:03,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:03,942 INFO L124 PetriNetUnfolderBase]: 4834/8441 cut-off events. [2025-01-10 00:44:03,943 INFO L125 PetriNetUnfolderBase]: For 3549/3632 co-relation queries the response was YES. [2025-01-10 00:44:03,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19212 conditions, 8441 events. 4834/8441 cut-off events. For 3549/3632 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 66226 event pairs, 1739 based on Foata normal form. 27/7453 useless extension candidates. Maximal degree in co-relation 19193. Up to 2963 conditions per place. [2025-01-10 00:44:03,988 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 40 selfloop transitions, 5 changer transitions 12/91 dead transitions. [2025-01-10 00:44:03,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 457 flow [2025-01-10 00:44:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:44:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:44:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2025-01-10 00:44:03,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6058201058201058 [2025-01-10 00:44:03,991 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 249 flow. Second operand 7 states and 229 transitions. [2025-01-10 00:44:03,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 457 flow [2025-01-10 00:44:03,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 434 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 00:44:03,997 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 256 flow [2025-01-10 00:44:03,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-01-10 00:44:03,998 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2025-01-10 00:44:03,999 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 256 flow [2025-01-10 00:44:04,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.727272727272727) internal successors, (294), 11 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:04,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:04,000 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:04,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:44:04,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1359734110, now seen corresponding path program 5 times [2025-01-10 00:44:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:44:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036109116] [2025-01-10 00:44:04,001 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:44:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:44:04,012 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:04,073 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:04,073 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:44:04,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:44:04,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:44:04,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:04,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:04,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:04,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:44:04,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:44:04,186 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:44:04,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:44:04,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:44:04,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:44:04,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:44:04,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:44:04,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:44:04,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:44:04,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:44:04,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:44:04,189 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2025-01-10 00:44:04,309 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:44:04,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:44:04,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:44:04 BasicIcfg [2025-01-10 00:44:04,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:44:04,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:44:04,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:44:04,321 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:44:04,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:43:48" (3/4) ... [2025-01-10 00:44:04,323 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:44:04,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:44:04,325 INFO L158 Benchmark]: Toolchain (without parser) took 16927.96ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 109.9MB in the beginning and 816.4MB in the end (delta: -706.4MB). Peak memory consumption was 414.1MB. Max. memory is 16.1GB. [2025-01-10 00:44:04,326 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:44:04,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.07ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 85.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:44:04,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.58ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:44:04,327 INFO L158 Benchmark]: Boogie Preprocessor took 43.77ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 80.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:44:04,327 INFO L158 Benchmark]: RCFGBuilder took 757.18ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 96.9MB in the end (delta: -16.4MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-01-10 00:44:04,328 INFO L158 Benchmark]: TraceAbstraction took 15546.69ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 96.2MB in the beginning and 816.6MB in the end (delta: -720.4MB). Peak memory consumption was 391.3MB. Max. memory is 16.1GB. [2025-01-10 00:44:04,328 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 1.3GB. Free memory was 816.6MB in the beginning and 816.4MB in the end (delta: 261.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:44:04,329 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.07ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 85.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.58ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.77ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 80.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 757.18ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 96.9MB in the end (delta: -16.4MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15546.69ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 96.2MB in the beginning and 816.6MB in the end (delta: -720.4MB). Peak memory consumption was 391.3MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 1.3GB. Free memory was 816.6MB in the beginning and 816.4MB in the end (delta: 261.1kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-1, t578=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-1, t578=0, t579=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=2, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L881] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix021_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 849]: 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: 847]: 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 9 procedures, 87 locations, 8 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: 15.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1344 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 54 mSDtfsCounter, 1344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=8, InterpolantAutomatonStates: 57, 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.8s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-01-10 00:44:04,352 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/mix021_tso.oepc.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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:44:06,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:44:06,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:44:06,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:44:06,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:44:06,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:44:06,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:44:06,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:44:06,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:44:06,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:44:06,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:44:06,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:44:06,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:44:06,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:44:06,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:44:06,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:44:06,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:44:06,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:44:06,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:44:06,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:44:06,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:44:06,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:44:06,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:44:06,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:44:06,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:44:06,957 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:44:06,957 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:44:06,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:44:06,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:44:06,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:44:06,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:44:06,957 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2025-01-10 00:44:07,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:44:07,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:44:07,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:44:07,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:44:07,312 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:44:07,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2025-01-10 00:44:08,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7b314dd7/0e4039f97a004db59d5359e110049936/FLAG707981099 [2025-01-10 00:44:08,963 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:44:08,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2025-01-10 00:44:08,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7b314dd7/0e4039f97a004db59d5359e110049936/FLAG707981099 [2025-01-10 00:44:09,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7b314dd7/0e4039f97a004db59d5359e110049936 [2025-01-10 00:44:09,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:44:09,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:44:09,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:44:09,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:44:09,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:44:09,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529168be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09, skipping insertion in model container [2025-01-10 00:44:09,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:44:09,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:44:09,439 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:44:09,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:44:09,569 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:44:09,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09 WrapperNode [2025-01-10 00:44:09,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:44:09,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:44:09,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:44:09,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:44:09,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,624 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2025-01-10 00:44:09,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:44:09,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:44:09,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:44:09,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:44:09,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,656 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:44:09,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:44:09,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:44:09,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:44:09,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:44:09,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (1/1) ... [2025-01-10 00:44:09,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:44:09,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:09,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:44:09,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:44:09,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:44:09,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:44:09,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:44:09,753 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:44:09,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:44:09,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:44:09,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:44:09,754 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:44:09,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:44:09,754 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:44:09,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:44:09,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:44:09,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:44:09,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:44:09,756 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:44:09,890 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:44:09,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:44:10,242 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:44:10,242 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:44:10,500 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:44:10,500 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:44:10,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:44:10 BoogieIcfgContainer [2025-01-10 00:44:10,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:44:10,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:44:10,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:44:10,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:44:10,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:44:09" (1/3) ... [2025-01-10 00:44:10,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75757fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:44:10, skipping insertion in model container [2025-01-10 00:44:10,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:44:09" (2/3) ... [2025-01-10 00:44:10,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75757fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:44:10, skipping insertion in model container [2025-01-10 00:44:10,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:44:10" (3/3) ... [2025-01-10 00:44:10,510 INFO L128 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2025-01-10 00:44:10,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:44:10,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix021_tso.oepc.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:44:10,526 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:44:10,623 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:44:10,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2025-01-10 00:44:10,706 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-01-10 00:44:10,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:44:10,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-01-10 00:44:10,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2025-01-10 00:44:10,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2025-01-10 00:44:10,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:44:10,745 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;@61b87d24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:44:10,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:44:10,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:44:10,756 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-01-10 00:44:10,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:44:10,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:10,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:44:10,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:10,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1467651085, now seen corresponding path program 1 times [2025-01-10 00:44:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714343534] [2025-01-10 00:44:10,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:44:10,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:10,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:10,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:10,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:44:10,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:44:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:44:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:10,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:10,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:44:10,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:10,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:10,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:10,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714343534] [2025-01-10 00:44:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714343534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:10,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:10,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:44:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360052933] [2025-01-10 00:44:10,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:10,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:44:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:10,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:44:10,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:44:10,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2025-01-10 00:44:10,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:10,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:10,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2025-01-10 00:44:10,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:11,698 INFO L124 PetriNetUnfolderBase]: 1711/2911 cut-off events. [2025-01-10 00:44:11,700 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:44:11,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2911 events. 1711/2911 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21030 event pairs, 310 based on Foata normal form. 144/3008 useless extension candidates. Maximal degree in co-relation 5395. Up to 1924 conditions per place. [2025-01-10 00:44:11,737 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 35 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-01-10 00:44:11,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 215 flow [2025-01-10 00:44:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:44:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:44:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-01-10 00:44:11,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2025-01-10 00:44:11,755 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 122 transitions. [2025-01-10 00:44:11,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 215 flow [2025-01-10 00:44:11,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:44:11,764 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2025-01-10 00:44:11,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-01-10 00:44:11,771 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-01-10 00:44:11,771 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2025-01-10 00:44:11,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:11,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:11,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:44:11,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:44:11,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:11,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:11,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -718133832, now seen corresponding path program 1 times [2025-01-10 00:44:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:11,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628580483] [2025-01-10 00:44:11,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:44:11,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:11,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:11,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:44:12,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:44:12,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:44:12,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:12,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:12,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:44:12,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:12,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:12,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628580483] [2025-01-10 00:44:12,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628580483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:12,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:12,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:44:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43212093] [2025-01-10 00:44:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:12,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:44:12,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:12,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:44:12,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:44:12,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2025-01-10 00:44:12,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:12,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:12,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2025-01-10 00:44:12,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:12,584 INFO L124 PetriNetUnfolderBase]: 1525/2605 cut-off events. [2025-01-10 00:44:12,585 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 00:44:12,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4997 conditions, 2605 events. 1525/2605 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18967 event pairs, 1525 based on Foata normal form. 72/2558 useless extension candidates. Maximal degree in co-relation 4987. Up to 2166 conditions per place. [2025-01-10 00:44:12,604 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 21 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2025-01-10 00:44:12,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 146 flow [2025-01-10 00:44:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:44:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:44:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-01-10 00:44:12,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 00:44:12,606 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 99 transitions. [2025-01-10 00:44:12,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 146 flow [2025-01-10 00:44:12,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:44:12,609 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2025-01-10 00:44:12,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-01-10 00:44:12,610 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-01-10 00:44:12,610 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2025-01-10 00:44:12,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:12,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:12,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:44:12,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:44:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:12,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash -718132610, now seen corresponding path program 1 times [2025-01-10 00:44:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739073853] [2025-01-10 00:44:12,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:44:12,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:12,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:12,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:12,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:44:12,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:44:12,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:44:12,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:12,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:12,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:44:12,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:12,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:12,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739073853] [2025-01-10 00:44:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739073853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:44:12,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159577518] [2025-01-10 00:44:12,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:12,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:44:12,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:12,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:44:12,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:44:12,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:44:12,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:12,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:12,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:44:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:13,964 INFO L124 PetriNetUnfolderBase]: 5957/8915 cut-off events. [2025-01-10 00:44:13,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:44:13,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17267 conditions, 8915 events. 5957/8915 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 60584 event pairs, 663 based on Foata normal form. 240/9089 useless extension candidates. Maximal degree in co-relation 17261. Up to 5353 conditions per place. [2025-01-10 00:44:14,028 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 48 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2025-01-10 00:44:14,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 268 flow [2025-01-10 00:44:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:44:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:44:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 00:44:14,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-01-10 00:44:14,032 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 141 transitions. [2025-01-10 00:44:14,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 268 flow [2025-01-10 00:44:14,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:44:14,035 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow [2025-01-10 00:44:14,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2025-01-10 00:44:14,036 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2025-01-10 00:44:14,037 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow [2025-01-10 00:44:14,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:14,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:14,038 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-01-10 00:44:14,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:44:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:14,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:14,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash -873695929, now seen corresponding path program 1 times [2025-01-10 00:44:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80859460] [2025-01-10 00:44:14,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:44:14,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:14,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:14,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:14,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:44:14,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:44:14,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:44:14,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:14,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:14,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:44:14,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:14,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:14,394 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:14,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80859460] [2025-01-10 00:44:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80859460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:14,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:44:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464363095] [2025-01-10 00:44:14,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:14,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:44:14,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:14,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:44:14,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:44:14,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:44:14,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:14,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:14,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:44:14,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:15,167 INFO L124 PetriNetUnfolderBase]: 4789/7231 cut-off events. [2025-01-10 00:44:15,167 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2025-01-10 00:44:15,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16550 conditions, 7231 events. 4789/7231 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 47363 event pairs, 249 based on Foata normal form. 228/7412 useless extension candidates. Maximal degree in co-relation 16541. Up to 3841 conditions per place. [2025-01-10 00:44:15,220 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 61 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2025-01-10 00:44:15,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 392 flow [2025-01-10 00:44:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:44:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:44:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-01-10 00:44:15,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2025-01-10 00:44:15,267 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 179 transitions. [2025-01-10 00:44:15,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 392 flow [2025-01-10 00:44:15,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 381 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:44:15,271 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow [2025-01-10 00:44:15,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-01-10 00:44:15,272 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2025-01-10 00:44:15,272 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow [2025-01-10 00:44:15,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:15,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:15,273 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] [2025-01-10 00:44:15,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:44:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:15,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:15,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1943165988, now seen corresponding path program 1 times [2025-01-10 00:44:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:15,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194697746] [2025-01-10 00:44:15,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:44:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:15,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:15,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:44:15,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:44:15,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:44:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:15,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:15,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:44:15,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:15,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:15,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194697746] [2025-01-10 00:44:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194697746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:15,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:44:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911227151] [2025-01-10 00:44:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:15,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:44:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:15,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:44:15,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:44:15,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:44:15,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:15,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:15,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:44:15,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:16,353 INFO L124 PetriNetUnfolderBase]: 3029/4587 cut-off events. [2025-01-10 00:44:16,353 INFO L125 PetriNetUnfolderBase]: For 3551/3551 co-relation queries the response was YES. [2025-01-10 00:44:16,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11822 conditions, 4587 events. 3029/4587 cut-off events. For 3551/3551 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 26778 event pairs, 115 based on Foata normal form. 172/4722 useless extension candidates. Maximal degree in co-relation 11811. Up to 1633 conditions per place. [2025-01-10 00:44:16,393 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 72 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2025-01-10 00:44:16,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 515 flow [2025-01-10 00:44:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:44:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:44:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-01-10 00:44:16,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2025-01-10 00:44:16,395 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 215 transitions. [2025-01-10 00:44:16,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 515 flow [2025-01-10 00:44:16,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 485 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:44:16,408 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow [2025-01-10 00:44:16,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2025-01-10 00:44:16,409 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2025-01-10 00:44:16,409 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow [2025-01-10 00:44:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:16,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:16,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:44:16,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:44:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:16,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1658316951, now seen corresponding path program 1 times [2025-01-10 00:44:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415287275] [2025-01-10 00:44:16,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:44:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:16,614 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:16,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:44:16,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:44:16,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:44:16,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:16,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:16,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:44:16,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:16,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:16,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:16,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415287275] [2025-01-10 00:44:16,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415287275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:16,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:16,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:44:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917822223] [2025-01-10 00:44:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:16,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:44:16,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:16,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:44:16,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:44:16,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-10 00:44:16,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:16,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:16,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-10 00:44:16,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:17,352 INFO L124 PetriNetUnfolderBase]: 1857/2747 cut-off events. [2025-01-10 00:44:17,353 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2025-01-10 00:44:17,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7927 conditions, 2747 events. 1857/2747 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14001 event pairs, 77 based on Foata normal form. 80/2791 useless extension candidates. Maximal degree in co-relation 7915. Up to 828 conditions per place. [2025-01-10 00:44:17,372 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 65 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2025-01-10 00:44:17,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 513 flow [2025-01-10 00:44:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:44:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:44:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2025-01-10 00:44:17,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164 [2025-01-10 00:44:17,374 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 233 transitions. [2025-01-10 00:44:17,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 513 flow [2025-01-10 00:44:17,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 467 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 00:44:17,388 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow [2025-01-10 00:44:17,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-01-10 00:44:17,388 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2025-01-10 00:44:17,389 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow [2025-01-10 00:44:17,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:17,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:17,389 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:17,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:44:17,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:17,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1139638624, now seen corresponding path program 1 times [2025-01-10 00:44:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:17,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527324589] [2025-01-10 00:44:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:44:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:17,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:17,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:17,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:44:17,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:17,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:17,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:17,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:17,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:44:17,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:17,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:17,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:17,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527324589] [2025-01-10 00:44:17,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527324589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:17,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:17,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:44:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800412378] [2025-01-10 00:44:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:17,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:44:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:17,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:44:17,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:44:17,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2025-01-10 00:44:17,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:17,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:17,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2025-01-10 00:44:17,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:18,453 INFO L124 PetriNetUnfolderBase]: 2504/4353 cut-off events. [2025-01-10 00:44:18,454 INFO L125 PetriNetUnfolderBase]: For 1916/2062 co-relation queries the response was YES. [2025-01-10 00:44:18,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9918 conditions, 4353 events. 2504/4353 cut-off events. For 1916/2062 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 28483 event pairs, 1078 based on Foata normal form. 16/3979 useless extension candidates. Maximal degree in co-relation 9905. Up to 1731 conditions per place. [2025-01-10 00:44:18,480 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 37 selfloop transitions, 2 changer transitions 19/88 dead transitions. [2025-01-10 00:44:18,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 451 flow [2025-01-10 00:44:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:44:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:44:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2025-01-10 00:44:18,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6080246913580247 [2025-01-10 00:44:18,481 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 6 states and 197 transitions. [2025-01-10 00:44:18,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 451 flow [2025-01-10 00:44:18,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 342 flow, removed 22 selfloop flow, removed 10 redundant places. [2025-01-10 00:44:18,494 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 171 flow [2025-01-10 00:44:18,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-01-10 00:44:18,496 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2025-01-10 00:44:18,496 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 171 flow [2025-01-10 00:44:18,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:18,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:18,497 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:18,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:44:18,697 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-01-10 00:44:18,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:18,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:18,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253842, now seen corresponding path program 2 times [2025-01-10 00:44:18,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490101130] [2025-01-10 00:44:18,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:44:18,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:18,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:18,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:18,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:44:18,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:18,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:18,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:44:18,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:18,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:44:18,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:18,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:18,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:18,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490101130] [2025-01-10 00:44:18,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490101130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:18,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:18,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:44:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731521977] [2025-01-10 00:44:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:18,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:44:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:18,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:44:18,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:44:18,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2025-01-10 00:44:18,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 171 flow. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:18,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:18,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2025-01-10 00:44:18,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:19,896 INFO L124 PetriNetUnfolderBase]: 6928/9957 cut-off events. [2025-01-10 00:44:19,896 INFO L125 PetriNetUnfolderBase]: For 1513/1639 co-relation queries the response was YES. [2025-01-10 00:44:19,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22726 conditions, 9957 events. 6928/9957 cut-off events. For 1513/1639 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 59040 event pairs, 1021 based on Foata normal form. 66/9823 useless extension candidates. Maximal degree in co-relation 22715. Up to 5076 conditions per place. [2025-01-10 00:44:19,932 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 55 selfloop transitions, 9 changer transitions 71/150 dead transitions. [2025-01-10 00:44:19,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 702 flow [2025-01-10 00:44:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:44:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:44:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 307 transitions. [2025-01-10 00:44:19,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685185185185185 [2025-01-10 00:44:19,934 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 171 flow. Second operand 10 states and 307 transitions. [2025-01-10 00:44:19,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 702 flow [2025-01-10 00:44:19,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 150 transitions, 690 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:44:19,939 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 213 flow [2025-01-10 00:44:19,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2025-01-10 00:44:19,940 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2025-01-10 00:44:19,942 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 213 flow [2025-01-10 00:44:19,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:19,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:19,943 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:19,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:44:20,146 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-01-10 00:44:20,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:20,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2120624774, now seen corresponding path program 3 times [2025-01-10 00:44:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584330056] [2025-01-10 00:44:20,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:44:20,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:20,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:20,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:44:20,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:20,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:20,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:44:20,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:20,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:44:20,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:20,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:20,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584330056] [2025-01-10 00:44:20,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584330056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:20,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:20,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:44:20,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663902865] [2025-01-10 00:44:20,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:20,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:44:20,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:20,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:44:20,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:44:20,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2025-01-10 00:44:20,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 213 flow. Second operand has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:20,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:20,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2025-01-10 00:44:20,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:21,309 INFO L124 PetriNetUnfolderBase]: 3833/6522 cut-off events. [2025-01-10 00:44:21,310 INFO L125 PetriNetUnfolderBase]: For 505/537 co-relation queries the response was YES. [2025-01-10 00:44:21,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13453 conditions, 6522 events. 3833/6522 cut-off events. For 505/537 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 47331 event pairs, 1337 based on Foata normal form. 18/5858 useless extension candidates. Maximal degree in co-relation 13438. Up to 2774 conditions per place. [2025-01-10 00:44:21,356 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 33 selfloop transitions, 4 changer transitions 17/89 dead transitions. [2025-01-10 00:44:21,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 394 flow [2025-01-10 00:44:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:44:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:44:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2025-01-10 00:44:21,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58994708994709 [2025-01-10 00:44:21,358 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 213 flow. Second operand 7 states and 223 transitions. [2025-01-10 00:44:21,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 394 flow [2025-01-10 00:44:21,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 89 transitions, 373 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:44:21,366 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 225 flow [2025-01-10 00:44:21,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2025-01-10 00:44:21,366 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2025-01-10 00:44:21,367 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 225 flow [2025-01-10 00:44:21,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:21,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:21,367 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:21,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 00:44:21,568 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-01-10 00:44:21,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1128402970, now seen corresponding path program 4 times [2025-01-10 00:44:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832631436] [2025-01-10 00:44:21,569 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:44:21,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:21,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:21,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:44:21,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-10 00:44:21,670 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 38 statements. [2025-01-10 00:44:21,670 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:44:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:21,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:44:21,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:21,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:21,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832631436] [2025-01-10 00:44:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832631436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:44:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979487231] [2025-01-10 00:44:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:21,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:44:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:21,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:44:21,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:44:21,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2025-01-10 00:44:21,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 225 flow. Second operand has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:21,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:21,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2025-01-10 00:44:21,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:22,798 INFO L124 PetriNetUnfolderBase]: 6801/11652 cut-off events. [2025-01-10 00:44:22,798 INFO L125 PetriNetUnfolderBase]: For 2033/2126 co-relation queries the response was YES. [2025-01-10 00:44:22,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25375 conditions, 11652 events. 6801/11652 cut-off events. For 2033/2126 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 92439 event pairs, 2601 based on Foata normal form. 25/10593 useless extension candidates. Maximal degree in co-relation 25359. Up to 3735 conditions per place. [2025-01-10 00:44:22,894 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 47 selfloop transitions, 6 changer transitions 27/115 dead transitions. [2025-01-10 00:44:22,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 115 transitions, 540 flow [2025-01-10 00:44:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:44:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:44:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2025-01-10 00:44:22,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6226851851851852 [2025-01-10 00:44:22,896 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 225 flow. Second operand 8 states and 269 transitions. [2025-01-10 00:44:22,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 115 transitions, 540 flow [2025-01-10 00:44:22,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 115 transitions, 514 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 00:44:22,900 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 272 flow [2025-01-10 00:44:22,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=272, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-01-10 00:44:22,901 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2025-01-10 00:44:22,901 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 272 flow [2025-01-10 00:44:22,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:22,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:22,902 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:22,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:44:23,106 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-01-10 00:44:23,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:23,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash -419705368, now seen corresponding path program 5 times [2025-01-10 00:44:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:23,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299359181] [2025-01-10 00:44:23,107 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:44:23,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:23,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:23,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:23,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:44:23,167 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:23,190 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:23,190 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:44:23,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:44:23,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:44:23,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:44:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:44:23,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:44:23,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:44:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299359181] [2025-01-10 00:44:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299359181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:44:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:44:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:44:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968089233] [2025-01-10 00:44:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:44:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:44:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:44:23,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:44:23,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:44:23,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2025-01-10 00:44:23,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 272 flow. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:23,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:44:23,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2025-01-10 00:44:23,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:44:25,312 INFO L124 PetriNetUnfolderBase]: 19731/28854 cut-off events. [2025-01-10 00:44:25,312 INFO L125 PetriNetUnfolderBase]: For 21074/21867 co-relation queries the response was YES. [2025-01-10 00:44:25,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77659 conditions, 28854 events. 19731/28854 cut-off events. For 21074/21867 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 199036 event pairs, 5787 based on Foata normal form. 136/28571 useless extension candidates. Maximal degree in co-relation 77641. Up to 17531 conditions per place. [2025-01-10 00:44:25,471 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 56 selfloop transitions, 7 changer transitions 80/159 dead transitions. [2025-01-10 00:44:25,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 159 transitions, 985 flow [2025-01-10 00:44:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:44:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:44:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2025-01-10 00:44:25,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5411522633744856 [2025-01-10 00:44:25,473 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 272 flow. Second operand 9 states and 263 transitions. [2025-01-10 00:44:25,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 159 transitions, 985 flow [2025-01-10 00:44:25,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 159 transitions, 955 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:44:25,485 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 285 flow [2025-01-10 00:44:25,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=285, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2025-01-10 00:44:25,485 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 23 predicate places. [2025-01-10 00:44:25,485 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 285 flow [2025-01-10 00:44:25,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:44:25,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:44:25,487 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, 1, 1, 1, 1, 1] [2025-01-10 00:44:25,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 00:44:25,687 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-01-10 00:44:25,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:44:25,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:44:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1752620240, now seen corresponding path program 6 times [2025-01-10 00:44:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:44:25,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466143867] [2025-01-10 00:44:25,689 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:44:25,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:44:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:44:25,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:44:25,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:44:25,749 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:25,770 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:25,770 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 00:44:25,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:44:25,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:44:25,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:44:25,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:44:25,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:44:25,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:44:25,862 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:44:25,862 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:44:25,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:44:25,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:44:25,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:44:25,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:44:25,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:44:25,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:44:25,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:44:25,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:44:25,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 00:44:26,068 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-01-10 00:44:26,068 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-01-10 00:44:26,161 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:44:26,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:44:26,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:44:26 BasicIcfg [2025-01-10 00:44:26,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:44:26,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:44:26,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:44:26,172 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:44:26,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:44:10" (3/4) ... [2025-01-10 00:44:26,175 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:44:26,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:44:26,176 INFO L158 Benchmark]: Toolchain (without parser) took 17165.92ms. Allocated memory was 117.4MB in the beginning and 947.9MB in the end (delta: 830.5MB). Free memory was 89.6MB in the beginning and 485.2MB in the end (delta: -395.6MB). Peak memory consumption was 435.5MB. Max. memory is 16.1GB. [2025-01-10 00:44:26,176 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:44:26,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.73ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 65.7MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:44:26,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.26ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:44:26,178 INFO L158 Benchmark]: Boogie Preprocessor took 58.77ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 60.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:44:26,178 INFO L158 Benchmark]: RCFGBuilder took 816.16ms. Allocated memory is still 117.4MB. Free memory was 60.2MB in the beginning and 43.0MB in the end (delta: 17.2MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-01-10 00:44:26,179 INFO L158 Benchmark]: TraceAbstraction took 15667.40ms. Allocated memory was 117.4MB in the beginning and 947.9MB in the end (delta: 830.5MB). Free memory was 42.3MB in the beginning and 485.2MB in the end (delta: -442.9MB). Peak memory consumption was 388.7MB. Max. memory is 16.1GB. [2025-01-10 00:44:26,179 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 947.9MB. Free memory was 485.2MB in the beginning and 485.2MB in the end (delta: 52.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:44:26,181 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.32ms. Allocated memory is still 83.9MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.73ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 65.7MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.26ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.77ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 60.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 816.16ms. Allocated memory is still 117.4MB. Free memory was 60.2MB in the beginning and 43.0MB in the end (delta: 17.2MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15667.40ms. Allocated memory was 117.4MB in the beginning and 947.9MB in the end (delta: 830.5MB). Free memory was 42.3MB in the beginning and 485.2MB in the end (delta: -442.9MB). Peak memory consumption was 388.7MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 947.9MB. Free memory was 485.2MB in the beginning and 485.2MB in the end (delta: 52.9kB). There was no memory consumed. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-3, t578=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-3, t578=-2, t579=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-3, t578=-2, t579=-1, t580=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-3, t578=-2, t579=-1, t580=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-3, t578=-2, t579=-1, t580=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-3, t578=-2, t579=-1, t580=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L881] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix021_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 849]: 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: 847]: 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 9 procedures, 87 locations, 8 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: 15.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 660 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 626 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2457 IncrementalHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 9 mSDtfsCounter, 2457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=11, InterpolantAutomatonStates: 68, 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.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 351 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 1375 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1377 ConjunctsInSsa, 94 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-01-10 00:44:26,202 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