./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:42,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:42,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:38:42,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:42,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:42,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:42,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:42,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:42,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:42,905 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:42,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:42,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:42,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:42,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:42,906 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:42,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:42,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:42,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:42,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:42,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:42,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:42,909 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2025-01-10 00:38:43,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:43,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:43,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:43,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:43,215 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:43,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-01-10 00:38:44,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48f3cb7a8/a8613747832e4767b9df7475ae882d62/FLAG6af8248d2 [2025-01-10 00:38:44,798 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:44,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-01-10 00:38:44,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48f3cb7a8/a8613747832e4767b9df7475ae882d62/FLAG6af8248d2 [2025-01-10 00:38:45,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48f3cb7a8/a8613747832e4767b9df7475ae882d62 [2025-01-10 00:38:45,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:45,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:45,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:45,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:45,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:45,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf2aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45, skipping insertion in model container [2025-01-10 00:38:45,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:45,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:45,379 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:45,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:45,445 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:45,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45 WrapperNode [2025-01-10 00:38:45,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:45,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:45,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:45,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:45,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,475 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2025-01-10 00:38:45,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:45,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:45,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:45,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:45,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,493 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:38:45,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:45,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:45,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:45,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:45,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (1/1) ... [2025-01-10 00:38:45,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:45,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:38:45,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:38:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:38:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-01-10 00:38:45,563 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-01-10 00:38:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:38:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:45,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-01-10 00:38:45,563 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-01-10 00:38:45,564 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:38:45,664 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:45,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:45,795 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:45,796 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:45,890 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:45,890 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:38:45,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:45 BoogieIcfgContainer [2025-01-10 00:38:45,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:45,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:45,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:45,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:45,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:45" (1/3) ... [2025-01-10 00:38:45,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6cfd6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:45, skipping insertion in model container [2025-01-10 00:38:45,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:45" (2/3) ... [2025-01-10 00:38:45,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6cfd6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:45, skipping insertion in model container [2025-01-10 00:38:45,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:45" (3/3) ... [2025-01-10 00:38:45,903 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-01-10 00:38:45,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:45,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 00:38:45,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:45,987 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:38:46,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 00:38:46,072 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-01-10 00:38:46,074 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:38:46,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 00:38:46,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 00:38:46,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2025-01-10 00:38:46,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:46,101 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;@64c2ea33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:46,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:38:46,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:46,116 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2025-01-10 00:38:46,116 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:38:46,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:46,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:46,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:38:46,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:46,126 INFO L85 PathProgramCache]: Analyzing trace with hash 636066479, now seen corresponding path program 1 times [2025-01-10 00:38:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676875077] [2025-01-10 00:38:46,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:46,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:46,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:38:46,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:38:46,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:46,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676875077] [2025-01-10 00:38:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676875077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:46,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:38:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146233326] [2025-01-10 00:38:46,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:46,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:46,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:46,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:38:46,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 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:38:46,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:46,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:38:46,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,867 INFO L124 PetriNetUnfolderBase]: 14102/24421 cut-off events. [2025-01-10 00:38:48,867 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2025-01-10 00:38:48,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45384 conditions, 24421 events. 14102/24421 cut-off events. For 2090/2090 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 210247 event pairs, 1527 based on Foata normal form. 2538/26333 useless extension candidates. Maximal degree in co-relation 40085. Up to 6266 conditions per place. [2025-01-10 00:38:49,059 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 179 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2025-01-10 00:38:49,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 233 transitions, 1015 flow [2025-01-10 00:38:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:38:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:38:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 544 transitions. [2025-01-10 00:38:49,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674937965260546 [2025-01-10 00:38:49,076 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 544 transitions. [2025-01-10 00:38:49,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 233 transitions, 1015 flow [2025-01-10 00:38:49,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 233 transitions, 937 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 00:38:49,139 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2025-01-10 00:38:49,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2025-01-10 00:38:49,144 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2025-01-10 00:38:49,145 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2025-01-10 00:38:49,145 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:38:49,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:49,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:49,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:49,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:38:49,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash 300194929, now seen corresponding path program 1 times [2025-01-10 00:38:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924202280] [2025-01-10 00:38:49,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:49,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:38:49,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:38:49,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:49,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924202280] [2025-01-10 00:38:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924202280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:49,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193330354] [2025-01-10 00:38:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:49,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:49,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:49,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2025-01-10 00:38:49,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:49,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:49,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2025-01-10 00:38:49,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:50,352 INFO L124 PetriNetUnfolderBase]: 6834/13886 cut-off events. [2025-01-10 00:38:50,353 INFO L125 PetriNetUnfolderBase]: For 4976/5295 co-relation queries the response was YES. [2025-01-10 00:38:50,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28294 conditions, 13886 events. 6834/13886 cut-off events. For 4976/5295 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 134465 event pairs, 2739 based on Foata normal form. 717/13669 useless extension candidates. Maximal degree in co-relation 22139. Up to 5307 conditions per place. [2025-01-10 00:38:50,472 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2025-01-10 00:38:50,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 486 flow [2025-01-10 00:38:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-01-10 00:38:50,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2025-01-10 00:38:50,474 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 138 transitions. [2025-01-10 00:38:50,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 486 flow [2025-01-10 00:38:50,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:50,583 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2025-01-10 00:38:50,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2025-01-10 00:38:50,584 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2025-01-10 00:38:50,584 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2025-01-10 00:38:50,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:50,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:50,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:50,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:38:50,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:50,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1645647337, now seen corresponding path program 2 times [2025-01-10 00:38:50,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:50,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831776556] [2025-01-10 00:38:50,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:50,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:38:50,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:38:50,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:50,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831776556] [2025-01-10 00:38:50,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831776556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:50,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:50,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:50,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137533917] [2025-01-10 00:38:50,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:50,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:50,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:50,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:50,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2025-01-10 00:38:50,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:50,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:50,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2025-01-10 00:38:50,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:51,783 INFO L124 PetriNetUnfolderBase]: 6316/12591 cut-off events. [2025-01-10 00:38:51,784 INFO L125 PetriNetUnfolderBase]: For 6176/6368 co-relation queries the response was YES. [2025-01-10 00:38:51,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27257 conditions, 12591 events. 6316/12591 cut-off events. For 6176/6368 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 113465 event pairs, 1680 based on Foata normal form. 318/12552 useless extension candidates. Maximal degree in co-relation 24216. Up to 3792 conditions per place. [2025-01-10 00:38:51,859 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 61 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2025-01-10 00:38:51,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 632 flow [2025-01-10 00:38:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:38:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:38:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-01-10 00:38:51,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2025-01-10 00:38:51,861 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 192 transitions. [2025-01-10 00:38:51,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 632 flow [2025-01-10 00:38:51,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:51,947 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 435 flow [2025-01-10 00:38:51,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2025-01-10 00:38:51,948 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2025-01-10 00:38:51,948 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 435 flow [2025-01-10 00:38:51,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:51,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:51,948 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:38:51,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:51,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:38:51,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash -763757256, now seen corresponding path program 1 times [2025-01-10 00:38:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139395737] [2025-01-10 00:38:51,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:51,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:38:51,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:38:51,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:51,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:52,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139395737] [2025-01-10 00:38:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139395737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:52,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:52,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:38:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765712362] [2025-01-10 00:38:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:52,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:52,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:52,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:52,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:52,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:38:52,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:52,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:52,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:38:52,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:53,577 INFO L124 PetriNetUnfolderBase]: 13472/22783 cut-off events. [2025-01-10 00:38:53,577 INFO L125 PetriNetUnfolderBase]: For 21011/21745 co-relation queries the response was YES. [2025-01-10 00:38:53,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56662 conditions, 22783 events. 13472/22783 cut-off events. For 21011/21745 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 182277 event pairs, 2029 based on Foata normal form. 460/22855 useless extension candidates. Maximal degree in co-relation 52344. Up to 5101 conditions per place. [2025-01-10 00:38:53,686 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 201 selfloop transitions, 70 changer transitions 0/301 dead transitions. [2025-01-10 00:38:53,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 301 transitions, 1810 flow [2025-01-10 00:38:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:38:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:38:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 504 transitions. [2025-01-10 00:38:53,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6253101736972705 [2025-01-10 00:38:53,689 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 435 flow. Second operand 13 states and 504 transitions. [2025-01-10 00:38:53,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 301 transitions, 1810 flow [2025-01-10 00:38:53,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 301 transitions, 1810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:53,951 INFO L231 Difference]: Finished difference. Result has 105 places, 157 transitions, 1038 flow [2025-01-10 00:38:53,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1038, PETRI_PLACES=105, PETRI_TRANSITIONS=157} [2025-01-10 00:38:53,952 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2025-01-10 00:38:53,952 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 157 transitions, 1038 flow [2025-01-10 00:38:53,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:53,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:53,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:53,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:53,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:38:53,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -911065372, now seen corresponding path program 1 times [2025-01-10 00:38:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:53,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081030636] [2025-01-10 00:38:53,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:53,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:38:53,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:38:53,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:53,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081030636] [2025-01-10 00:38:54,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081030636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:54,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:38:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847821023] [2025-01-10 00:38:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:54,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:54,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:54,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:54,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:38:54,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 157 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:54,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:54,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:38:54,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:56,383 INFO L124 PetriNetUnfolderBase]: 14310/24144 cut-off events. [2025-01-10 00:38:56,383 INFO L125 PetriNetUnfolderBase]: For 36560/36909 co-relation queries the response was YES. [2025-01-10 00:38:56,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70727 conditions, 24144 events. 14310/24144 cut-off events. For 36560/36909 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 194157 event pairs, 3049 based on Foata normal form. 444/24353 useless extension candidates. Maximal degree in co-relation 66403. Up to 7170 conditions per place. [2025-01-10 00:38:56,541 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 198 selfloop transitions, 87 changer transitions 0/315 dead transitions. [2025-01-10 00:38:56,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 315 transitions, 2346 flow [2025-01-10 00:38:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:38:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:38:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 484 transitions. [2025-01-10 00:38:56,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6004962779156328 [2025-01-10 00:38:56,545 INFO L175 Difference]: Start difference. First operand has 105 places, 157 transitions, 1038 flow. Second operand 13 states and 484 transitions. [2025-01-10 00:38:56,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 315 transitions, 2346 flow [2025-01-10 00:38:57,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 315 transitions, 2344 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:57,040 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1516 flow [2025-01-10 00:38:57,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1516, PETRI_PLACES=121, PETRI_TRANSITIONS=186} [2025-01-10 00:38:57,041 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2025-01-10 00:38:57,041 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1516 flow [2025-01-10 00:38:57,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:57,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:57,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:57,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:57,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:38:57,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1825893142, now seen corresponding path program 1 times [2025-01-10 00:38:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023105247] [2025-01-10 00:38:57,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:57,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:57,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:38:57,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:38:57,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:57,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023105247] [2025-01-10 00:38:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023105247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:57,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:38:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839466215] [2025-01-10 00:38:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:57,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:57,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:57,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:38:57,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 186 transitions, 1516 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:57,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:57,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:38:57,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:59,292 INFO L124 PetriNetUnfolderBase]: 15074/25341 cut-off events. [2025-01-10 00:38:59,292 INFO L125 PetriNetUnfolderBase]: For 55380/55972 co-relation queries the response was YES. [2025-01-10 00:38:59,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78221 conditions, 25341 events. 15074/25341 cut-off events. For 55380/55972 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 202802 event pairs, 2998 based on Foata normal form. 648/25708 useless extension candidates. Maximal degree in co-relation 74131. Up to 7239 conditions per place. [2025-01-10 00:38:59,518 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 212 selfloop transitions, 94 changer transitions 0/350 dead transitions. [2025-01-10 00:38:59,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 350 transitions, 2914 flow [2025-01-10 00:38:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:38:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:38:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2025-01-10 00:38:59,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6029776674937966 [2025-01-10 00:38:59,520 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1516 flow. Second operand 13 states and 486 transitions. [2025-01-10 00:38:59,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 350 transitions, 2914 flow [2025-01-10 00:39:00,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 2900 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 00:39:00,485 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2010 flow [2025-01-10 00:39:00,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2010, PETRI_PLACES=136, PETRI_TRANSITIONS=215} [2025-01-10 00:39:00,486 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 70 predicate places. [2025-01-10 00:39:00,486 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2010 flow [2025-01-10 00:39:00,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:00,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:00,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:39:00,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash -700195909, now seen corresponding path program 1 times [2025-01-10 00:39:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298410423] [2025-01-10 00:39:00,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:00,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:39:00,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:39:00,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:00,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:39:00,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:39:00,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:39:00,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:00,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:39:00,554 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:39:00,555 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:39:00,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:39:00,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:39:00,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:39:00,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:39:00,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:39:00,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:39:00,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:39:00,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:39:00,563 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 00:39:00,619 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:39:00,619 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:39:00,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:39:00 BasicIcfg [2025-01-10 00:39:00,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:39:00,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:39:00,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:39:00,627 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:39:00,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:45" (3/4) ... [2025-01-10 00:39:00,630 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:39:00,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:39:00,632 INFO L158 Benchmark]: Toolchain (without parser) took 15565.56ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 104.8MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 884.7MB. Max. memory is 16.1GB. [2025-01-10 00:39:00,634 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 124.9MB in the end (delta: 922.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:39:00,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.70ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 85.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:39:00,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.05ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:39:00,635 INFO L158 Benchmark]: Boogie Preprocessor took 31.55ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:39:00,635 INFO L158 Benchmark]: RCFGBuilder took 382.33ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 61.1MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:39:00,635 INFO L158 Benchmark]: TraceAbstraction took 14733.30ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 61.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 842.8MB. Max. memory is 16.1GB. [2025-01-10 00:39:00,635 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 3.6GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 170.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:39:00,637 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.24ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 124.9MB in the end (delta: 922.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.70ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 85.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.05ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.55ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.33ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 61.1MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14733.30ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 61.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 842.8MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 3.6GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 170.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: 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: 749]: 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: 750]: 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: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 84 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: 14.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1870 IncrementalHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 115 mSDtfsCounter, 1870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2010occurred in iteration=6, InterpolantAutomatonStates: 59, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:39:00,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:39:03,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:39:03,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:39:03,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:39:03,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:39:03,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:39:03,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:39:03,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:39:03,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:39:03,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:39:03,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:39:03,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:39:03,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:39:03,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:39:03,401 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:39:03,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:39:03,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:39:03,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:39:03,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:39:03,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:39:03,402 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:39:03,403 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:39:03,403 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:39:03,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:39:03,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:39:03,403 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:39:03,403 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:39:03,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:39:03,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:39:03,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:39:03,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:39:03,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:39:03,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:39:03,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:39:03,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:39:03,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:39:03,406 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:39:03,406 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:39:03,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:39:03,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:39:03,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:39:03,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:39:03,407 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2025-01-10 00:39:03,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:39:03,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:39:03,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:39:03,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:39:03,718 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:39:03,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-01-10 00:39:05,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a7879a12/b1e130a8d18441bca038d524c6ca0ac8/FLAG964d00430 [2025-01-10 00:39:05,339 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:39:05,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-01-10 00:39:05,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a7879a12/b1e130a8d18441bca038d524c6ca0ac8/FLAG964d00430 [2025-01-10 00:39:05,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a7879a12/b1e130a8d18441bca038d524c6ca0ac8 [2025-01-10 00:39:05,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:39:05,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:39:05,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:39:05,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:39:05,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:39:05,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af46538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05, skipping insertion in model container [2025-01-10 00:39:05,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:39:05,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:39:05,766 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:39:05,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:39:05,880 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:39:05,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05 WrapperNode [2025-01-10 00:39:05,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:39:05,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:39:05,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:39:05,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:39:05,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,934 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2025-01-10 00:39:05,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:39:05,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:39:05,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:39:05,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:39:05,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:39:05,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:05,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:39:05,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:39:05,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:39:05,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:39:05,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (1/1) ... [2025-01-10 00:39:06,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:39:06,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:06,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:39:06,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:39:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:39:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:39:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-01-10 00:39:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-01-10 00:39:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:39:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:39:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:39:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:39:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-01-10 00:39:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-01-10 00:39:06,059 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:39:06,176 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:39:06,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:39:06,395 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:39:06,397 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:39:06,559 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:39:06,559 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:39:06,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:06 BoogieIcfgContainer [2025-01-10 00:39:06,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:39:06,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:39:06,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:39:06,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:39:06,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:39:05" (1/3) ... [2025-01-10 00:39:06,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264ca79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:06, skipping insertion in model container [2025-01-10 00:39:06,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:05" (2/3) ... [2025-01-10 00:39:06,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264ca79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:06, skipping insertion in model container [2025-01-10 00:39:06,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:06" (3/3) ... [2025-01-10 00:39:06,571 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-01-10 00:39:06,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:39:06,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 00:39:06,598 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:39:06,669 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:39:06,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 00:39:06,750 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-01-10 00:39:06,753 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:39:06,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 00:39:06,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 00:39:06,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2025-01-10 00:39:06,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:39:06,781 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;@54bfbda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:39:06,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:39:06,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:39:06,802 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2025-01-10 00:39:06,802 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:39:06,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:06,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:06,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 398639909, now seen corresponding path program 1 times [2025-01-10 00:39:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:06,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620711072] [2025-01-10 00:39:06,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:06,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:06,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:06,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:39:06,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:39:06,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:39:06,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:06,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:06,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:06,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:07,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:39:07,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:07,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620711072] [2025-01-10 00:39:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620711072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:39:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481112143] [2025-01-10 00:39:07,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:07,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:07,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:07,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:07,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:39:07,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 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:39:07,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:07,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:39:07,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:09,748 INFO L124 PetriNetUnfolderBase]: 14102/24413 cut-off events. [2025-01-10 00:39:09,748 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2025-01-10 00:39:09,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45376 conditions, 24413 events. 14102/24413 cut-off events. For 2090/2090 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 210051 event pairs, 1535 based on Foata normal form. 2538/26328 useless extension candidates. Maximal degree in co-relation 40077. Up to 6266 conditions per place. [2025-01-10 00:39:09,983 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 179 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2025-01-10 00:39:09,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 233 transitions, 1015 flow [2025-01-10 00:39:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:39:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:39:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 544 transitions. [2025-01-10 00:39:09,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674937965260546 [2025-01-10 00:39:10,000 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 544 transitions. [2025-01-10 00:39:10,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 233 transitions, 1015 flow [2025-01-10 00:39:10,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 233 transitions, 937 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 00:39:10,035 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2025-01-10 00:39:10,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2025-01-10 00:39:10,042 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2025-01-10 00:39:10,043 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2025-01-10 00:39:10,043 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:39:10,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:10,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:10,055 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:39:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:10,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:10,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1322923133, now seen corresponding path program 1 times [2025-01-10 00:39:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465033758] [2025-01-10 00:39:10,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:10,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:10,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:10,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:39:10,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:39:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:39:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:10,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:39:10,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:10,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:10,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:10,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465033758] [2025-01-10 00:39:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465033758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:10,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:39:10,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203370729] [2025-01-10 00:39:10,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:10,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:10,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:10,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:10,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2025-01-10 00:39:10,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:10,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:10,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2025-01-10 00:39:10,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:11,523 INFO L124 PetriNetUnfolderBase]: 6853/13824 cut-off events. [2025-01-10 00:39:11,523 INFO L125 PetriNetUnfolderBase]: For 4754/5073 co-relation queries the response was YES. [2025-01-10 00:39:11,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28252 conditions, 13824 events. 6853/13824 cut-off events. For 4754/5073 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 133157 event pairs, 2733 based on Foata normal form. 709/13627 useless extension candidates. Maximal degree in co-relation 22097. Up to 5355 conditions per place. [2025-01-10 00:39:11,638 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2025-01-10 00:39:11,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 486 flow [2025-01-10 00:39:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-01-10 00:39:11,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2025-01-10 00:39:11,642 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 138 transitions. [2025-01-10 00:39:11,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 486 flow [2025-01-10 00:39:11,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:11,753 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2025-01-10 00:39:11,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2025-01-10 00:39:11,755 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2025-01-10 00:39:11,755 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2025-01-10 00:39:11,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:11,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:11,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:11,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:39:11,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:11,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:11,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1792466541, now seen corresponding path program 2 times [2025-01-10 00:39:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378387683] [2025-01-10 00:39:11,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:11,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:11,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:11,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:11,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:39:12,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:39:12,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:39:12,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:39:12,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:12,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:39:12,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:12,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:12,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378387683] [2025-01-10 00:39:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378387683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:39:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130872523] [2025-01-10 00:39:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:12,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:39:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:12,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:39:12,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:39:12,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2025-01-10 00:39:12,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:12,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:12,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2025-01-10 00:39:12,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:13,531 INFO L124 PetriNetUnfolderBase]: 10042/19609 cut-off events. [2025-01-10 00:39:13,531 INFO L125 PetriNetUnfolderBase]: For 9818/10163 co-relation queries the response was YES. [2025-01-10 00:39:13,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42115 conditions, 19609 events. 10042/19609 cut-off events. For 9818/10163 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 191525 event pairs, 3002 based on Foata normal form. 273/18856 useless extension candidates. Maximal degree in co-relation 34821. Up to 7305 conditions per place. [2025-01-10 00:39:13,716 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 58 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2025-01-10 00:39:13,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 622 flow [2025-01-10 00:39:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:39:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:39:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-01-10 00:39:13,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7701612903225806 [2025-01-10 00:39:13,718 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 191 transitions. [2025-01-10 00:39:13,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 622 flow [2025-01-10 00:39:13,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 132 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:39:13,972 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 444 flow [2025-01-10 00:39:13,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2025-01-10 00:39:13,973 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-01-10 00:39:13,973 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 444 flow [2025-01-10 00:39:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:13,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:13,973 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:39:13,981 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:39:14,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:14,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1308458934, now seen corresponding path program 1 times [2025-01-10 00:39:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178089159] [2025-01-10 00:39:14,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:14,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:14,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:14,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:39:14,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:39:14,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:39:14,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:14,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:14,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:14,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:14,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:14,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178089159] [2025-01-10 00:39:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178089159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:14,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:14,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:39:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123168337] [2025-01-10 00:39:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:14,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:14,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:14,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:14,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:14,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:39:14,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:14,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:14,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:39:14,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:18,249 INFO L124 PetriNetUnfolderBase]: 39831/66882 cut-off events. [2025-01-10 00:39:18,249 INFO L125 PetriNetUnfolderBase]: For 60521/62209 co-relation queries the response was YES. [2025-01-10 00:39:18,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166610 conditions, 66882 events. 39831/66882 cut-off events. For 60521/62209 co-relation queries the response was YES. Maximal size of possible extension queue 4079. Compared 638284 event pairs, 5836 based on Foata normal form. 1154/66067 useless extension candidates. Maximal degree in co-relation 138036. Up to 14971 conditions per place. [2025-01-10 00:39:18,712 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 251 selfloop transitions, 153 changer transitions 0/434 dead transitions. [2025-01-10 00:39:18,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 434 transitions, 2802 flow [2025-01-10 00:39:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:39:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:39:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 510 transitions. [2025-01-10 00:39:18,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6327543424317618 [2025-01-10 00:39:18,714 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 444 flow. Second operand 13 states and 510 transitions. [2025-01-10 00:39:18,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 434 transitions, 2802 flow [2025-01-10 00:39:20,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 434 transitions, 2784 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:20,891 INFO L231 Difference]: Finished difference. Result has 102 places, 275 transitions, 2009 flow [2025-01-10 00:39:20,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2009, PETRI_PLACES=102, PETRI_TRANSITIONS=275} [2025-01-10 00:39:20,893 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 36 predicate places. [2025-01-10 00:39:20,893 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 275 transitions, 2009 flow [2025-01-10 00:39:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:20,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:20,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:20,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:39:21,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:21,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:21,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash -138968134, now seen corresponding path program 1 times [2025-01-10 00:39:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742577884] [2025-01-10 00:39:21,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:21,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:21,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:21,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:39:21,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:39:21,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:39:21,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:21,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:21,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:21,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:21,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:21,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:21,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742577884] [2025-01-10 00:39:21,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742577884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:21,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:21,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:39:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013395263] [2025-01-10 00:39:21,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:21,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:21,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:21,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:21,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:39:21,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 275 transitions, 2009 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:21,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:21,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:39:21,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:27,158 INFO L124 PetriNetUnfolderBase]: 44162/73397 cut-off events. [2025-01-10 00:39:27,158 INFO L125 PetriNetUnfolderBase]: For 114943/116223 co-relation queries the response was YES. [2025-01-10 00:39:27,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219204 conditions, 73397 events. 44162/73397 cut-off events. For 114943/116223 co-relation queries the response was YES. Maximal size of possible extension queue 4404. Compared 700880 event pairs, 7853 based on Foata normal form. 1478/73757 useless extension candidates. Maximal degree in co-relation 189967. Up to 21084 conditions per place. [2025-01-10 00:39:27,979 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 280 selfloop transitions, 223 changer transitions 0/533 dead transitions. [2025-01-10 00:39:27,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 533 transitions, 4501 flow [2025-01-10 00:39:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:39:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:39:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 502 transitions. [2025-01-10 00:39:27,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228287841191067 [2025-01-10 00:39:27,982 INFO L175 Difference]: Start difference. First operand has 102 places, 275 transitions, 2009 flow. Second operand 13 states and 502 transitions. [2025-01-10 00:39:27,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 533 transitions, 4501 flow [2025-01-10 00:39:35,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 533 transitions, 4499 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:35,572 INFO L231 Difference]: Finished difference. Result has 122 places, 363 transitions, 3507 flow [2025-01-10 00:39:35,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3507, PETRI_PLACES=122, PETRI_TRANSITIONS=363} [2025-01-10 00:39:35,573 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 56 predicate places. [2025-01-10 00:39:35,573 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 363 transitions, 3507 flow [2025-01-10 00:39:35,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:35,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:35,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:35,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:39:35,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:35,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1647609722, now seen corresponding path program 1 times [2025-01-10 00:39:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:35,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12497676] [2025-01-10 00:39:35,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:35,778 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:35,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:39:35,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:39:35,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:39:35,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:35,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:35,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:39:35,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:35,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:35,871 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12497676] [2025-01-10 00:39:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12497676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:35,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:35,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:39:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873152717] [2025-01-10 00:39:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:35,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:39:35,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:35,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:39:35,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:39:35,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2025-01-10 00:39:35,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 363 transitions, 3507 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:35,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:35,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2025-01-10 00:39:35,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:42,290 INFO L124 PetriNetUnfolderBase]: 46598/77018 cut-off events. [2025-01-10 00:39:42,290 INFO L125 PetriNetUnfolderBase]: For 200392/202488 co-relation queries the response was YES. [2025-01-10 00:39:42,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250258 conditions, 77018 events. 46598/77018 cut-off events. For 200392/202488 co-relation queries the response was YES. Maximal size of possible extension queue 4635. Compared 735238 event pairs, 8083 based on Foata normal form. 1785/77377 useless extension candidates. Maximal degree in co-relation 222700. Up to 22881 conditions per place. [2025-01-10 00:39:43,223 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 327 selfloop transitions, 268 changer transitions 0/645 dead transitions. [2025-01-10 00:39:43,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 645 transitions, 6612 flow [2025-01-10 00:39:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:39:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:39:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 506 transitions. [2025-01-10 00:39:43,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6277915632754343 [2025-01-10 00:39:43,225 INFO L175 Difference]: Start difference. First operand has 122 places, 363 transitions, 3507 flow. Second operand 13 states and 506 transitions. [2025-01-10 00:39:43,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 645 transitions, 6612 flow [2025-01-10 00:39:49,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 645 transitions, 6604 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:49,877 INFO L231 Difference]: Finished difference. Result has 142 places, 463 transitions, 5413 flow [2025-01-10 00:39:49,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3499, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5413, PETRI_PLACES=142, PETRI_TRANSITIONS=463} [2025-01-10 00:39:49,878 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 76 predicate places. [2025-01-10 00:39:49,878 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 463 transitions, 5413 flow [2025-01-10 00:39:49,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:49,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:49,878 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:39:49,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:39:50,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:50,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:50,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash 888826727, now seen corresponding path program 1 times [2025-01-10 00:39:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831561636] [2025-01-10 00:39:50,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:50,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:50,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:50,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:39:50,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:39:50,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:39:50,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:50,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:39:50,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:50,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:50,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:39:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831561636] [2025-01-10 00:39:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831561636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:50,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:39:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924536662] [2025-01-10 00:39:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:50,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:39:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:39:50,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:39:50,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:39:50,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2025-01-10 00:39:50,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 463 transitions, 5413 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 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:39:50,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:50,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2025-01-10 00:39:50,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:51,753 INFO L124 PetriNetUnfolderBase]: 8924/17316 cut-off events. [2025-01-10 00:39:51,754 INFO L125 PetriNetUnfolderBase]: For 45371/47114 co-relation queries the response was YES. [2025-01-10 00:39:51,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54079 conditions, 17316 events. 8924/17316 cut-off events. For 45371/47114 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 157564 event pairs, 2543 based on Foata normal form. 482/17347 useless extension candidates. Maximal degree in co-relation 51677. Up to 5406 conditions per place. [2025-01-10 00:39:51,898 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 59 selfloop transitions, 13 changer transitions 0/254 dead transitions. [2025-01-10 00:39:51,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 254 transitions, 2315 flow [2025-01-10 00:39:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:39:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:39:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-01-10 00:39:51,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7225806451612903 [2025-01-10 00:39:51,899 INFO L175 Difference]: Start difference. First operand has 142 places, 463 transitions, 5413 flow. Second operand 5 states and 224 transitions. [2025-01-10 00:39:51,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 254 transitions, 2315 flow [2025-01-10 00:39:52,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 254 transitions, 2307 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:52,615 INFO L231 Difference]: Finished difference. Result has 147 places, 221 transitions, 2119 flow [2025-01-10 00:39:52,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2077, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2119, PETRI_PLACES=147, PETRI_TRANSITIONS=221} [2025-01-10 00:39:52,616 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 81 predicate places. [2025-01-10 00:39:52,616 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 221 transitions, 2119 flow [2025-01-10 00:39:52,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 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:39:52,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:52,617 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] [2025-01-10 00:39:52,623 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:39:52,817 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:39:52,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:39:52,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash 989805485, now seen corresponding path program 1 times [2025-01-10 00:39:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:39:52,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509456976] [2025-01-10 00:39:52,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:52,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:52,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:52,821 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:39:52,822 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:39:52,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:39:52,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:39:52,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:52,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:39:52,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:39:52,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:39:52,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:52,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:52,957 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:39:52,958 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:39:52,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:39:52,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:39:52,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:39:52,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:39:52,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:39:52,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:39:52,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:39:52,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:39:52,974 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:39:53,169 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:39:53,169 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:53,227 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:39:53,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:39:53,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:39:53 BasicIcfg [2025-01-10 00:39:53,234 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:39:53,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:39:53,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:39:53,235 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:39:53,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:06" (3/4) ... [2025-01-10 00:39:53,237 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:39:53,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:39:53,240 INFO L158 Benchmark]: Toolchain (without parser) took 47854.88ms. Allocated memory was 117.4MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 91.8MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2025-01-10 00:39:53,240 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:39:53,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.63ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 71.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:39:53,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.63ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 69.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:39:53,241 INFO L158 Benchmark]: Boogie Preprocessor took 53.37ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 67.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:39:53,242 INFO L158 Benchmark]: RCFGBuilder took 569.47ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 39.0MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:39:53,242 INFO L158 Benchmark]: TraceAbstraction took 46671.65ms. Allocated memory was 117.4MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 38.5MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2025-01-10 00:39:53,242 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 10.4GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 455.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:39:53,244 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.33ms. Allocated memory is still 83.9MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.63ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 71.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.63ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 69.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.37ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 67.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 569.47ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 39.0MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 46671.65ms. Allocated memory was 117.4MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 38.5MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 10.4GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 455.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 751]: 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: 752]: 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: 749]: 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: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 84 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: 46.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 813 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 739 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2095 IncrementalHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 101 mSDtfsCounter, 2095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5413occurred in iteration=6, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 12 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:39:53,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample