./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:12:07,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:12:07,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:12:07,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:12:07,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:12:07,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:12:07,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:12:07,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:12:07,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:12:07,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:12:07,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:12:07,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:12:07,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:12:07,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:12:07,503 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:12:07,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:12:07,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:12:07,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:12:07,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:12:07,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:12:07,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:12:07,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:12:07,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:12:07,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:12:07,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:12:07,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:12:07,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:12:07,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:12:07,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:12:07,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:12:07,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:12:07,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:12:07,506 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-02-08 08:12:07,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:12:07,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:12:07,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:12:07,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:12:07,776 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:12:07,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-02-08 08:12:08,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/943f402c8/410cae71bc904a8c956bad7e698bac25/FLAGc6bb06060 [2025-02-08 08:12:09,197 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:12:09,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-02-08 08:12:09,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/943f402c8/410cae71bc904a8c956bad7e698bac25/FLAGc6bb06060 [2025-02-08 08:12:09,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/943f402c8/410cae71bc904a8c956bad7e698bac25 [2025-02-08 08:12:09,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:12:09,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:12:09,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:12:09,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:12:09,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:12:09,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8b4742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09, skipping insertion in model container [2025-02-08 08:12:09,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:12:09,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:12:09,755 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:12:09,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:12:09,811 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:12:09,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09 WrapperNode [2025-02-08 08:12:09,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:12:09,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:12:09,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:12:09,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:12:09,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,836 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2025-02-08 08:12:09,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:12:09,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:12:09,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:12:09,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:12:09,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,852 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-02-08 08:12:09,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:12:09,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:12:09,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:12:09,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:12:09,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (1/1) ... [2025-02-08 08:12:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:12:09,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:09,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:12:09,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:12:09,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:12:09,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:12:09,915 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:12:09,998 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:12:10,000 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:12:10,167 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:12:10,168 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:12:10,263 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:12:10,263 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:12:10,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:12:10 BoogieIcfgContainer [2025-02-08 08:12:10,264 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:12:10,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:12:10,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:12:10,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:12:10,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:12:09" (1/3) ... [2025-02-08 08:12:10,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214e670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:12:10, skipping insertion in model container [2025-02-08 08:12:10,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:09" (2/3) ... [2025-02-08 08:12:10,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214e670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:12:10, skipping insertion in model container [2025-02-08 08:12:10,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:12:10" (3/3) ... [2025-02-08 08:12:10,273 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-02-08 08:12:10,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:12:10,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 08:12:10,288 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:12:10,328 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:10,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 36 transitions, 76 flow [2025-02-08 08:12:10,368 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-02-08 08:12:10,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:10,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 40 events. 4/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-08 08:12:10,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 36 transitions, 76 flow [2025-02-08 08:12:10,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 36 transitions, 76 flow [2025-02-08 08:12:10,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:10,394 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;@5f1b379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:10,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 08:12:10,397 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:10,399 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:12:10,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:10,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:10,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:10,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-08 08:12:10,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash 253430, now seen corresponding path program 1 times [2025-02-08 08:12:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076040812] [2025-02-08 08:12:10,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:10,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:10,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:10,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:10,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:10,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:10,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076040812] [2025-02-08 08:12:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076040812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:10,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14046860] [2025-02-08 08:12:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:10,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:10,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:10,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-02-08 08:12:10,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:10,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:10,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-02-08 08:12:10,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:10,679 INFO L124 PetriNetUnfolderBase]: 22/80 cut-off events. [2025-02-08 08:12:10,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:10,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 80 events. 22/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 208 event pairs, 18 based on Foata normal form. 6/82 useless extension candidates. Maximal degree in co-relation 119. Up to 56 conditions per place. [2025-02-08 08:12:10,683 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 16 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-02-08 08:12:10,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 94 flow [2025-02-08 08:12:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-08 08:12:10,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-02-08 08:12:10,694 INFO L175 Difference]: Start difference. First operand has 35 places, 36 transitions, 76 flow. Second operand 3 states and 58 transitions. [2025-02-08 08:12:10,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 94 flow [2025-02-08 08:12:10,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:10,698 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 62 flow [2025-02-08 08:12:10,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2025-02-08 08:12:10,702 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2025-02-08 08:12:10,702 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 62 flow [2025-02-08 08:12:10,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:10,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:10,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:10,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:12:10,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-08 08:12:10,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash 253431, now seen corresponding path program 1 times [2025-02-08 08:12:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717752361] [2025-02-08 08:12:10,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:10,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:10,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:10,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:10,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717752361] [2025-02-08 08:12:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717752361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:10,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537896539] [2025-02-08 08:12:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:10,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:10,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:10,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:10,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:10,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-02-08 08:12:10,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:10,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:10,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-02-08 08:12:10,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:10,882 INFO L124 PetriNetUnfolderBase]: 22/82 cut-off events. [2025-02-08 08:12:10,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:10,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 82 events. 22/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 208 event pairs, 18 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 141. Up to 58 conditions per place. [2025-02-08 08:12:10,883 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 18 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-02-08 08:12:10,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 106 flow [2025-02-08 08:12:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-02-08 08:12:10,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-02-08 08:12:10,886 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 62 flow. Second operand 3 states and 61 transitions. [2025-02-08 08:12:10,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 106 flow [2025-02-08 08:12:10,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:10,888 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 75 flow [2025-02-08 08:12:10,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-02-08 08:12:10,890 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-02-08 08:12:10,890 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 75 flow [2025-02-08 08:12:10,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:10,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:10,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:12:10,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:12:10,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-08 08:12:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 243555567, now seen corresponding path program 1 times [2025-02-08 08:12:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664629576] [2025-02-08 08:12:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:10,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:10,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:10,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:10,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664629576] [2025-02-08 08:12:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664629576] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:11,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297498830] [2025-02-08 08:12:11,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:11,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:11,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:11,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:12:11,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:11,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:11,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:11,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:11,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:12:11,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:11,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:12:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297498830] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:12:11,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:12:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-02-08 08:12:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515924435] [2025-02-08 08:12:11,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:12:11,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:12:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:11,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:12:11,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:12:11,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-02-08 08:12:11,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 75 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:11,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:11,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-02-08 08:12:11,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:11,398 INFO L124 PetriNetUnfolderBase]: 24/90 cut-off events. [2025-02-08 08:12:11,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:11,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 90 events. 24/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 235 event pairs, 18 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 167. Up to 60 conditions per place. [2025-02-08 08:12:11,399 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 21 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-02-08 08:12:11,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 159 flow [2025-02-08 08:12:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:12:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:12:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-02-08 08:12:11,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-02-08 08:12:11,400 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 75 flow. Second operand 6 states and 110 transitions. [2025-02-08 08:12:11,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 159 flow [2025-02-08 08:12:11,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:11,401 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 125 flow [2025-02-08 08:12:11,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-02-08 08:12:11,401 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-02-08 08:12:11,401 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 125 flow [2025-02-08 08:12:11,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:11,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:11,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 08:12:11,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:11,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-08 08:12:11,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash 172578403, now seen corresponding path program 1 times [2025-02-08 08:12:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993132155] [2025-02-08 08:12:11,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:11,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:11,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:11,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:11,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:11,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:11,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993132155] [2025-02-08 08:12:11,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993132155] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:11,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894794740] [2025-02-08 08:12:11,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:11,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:11,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:11,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:11,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:12:11,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:11,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:11,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:11,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:11,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:12:11,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:11,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:12:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894794740] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:12:11,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:12:11,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 08:12:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142794938] [2025-02-08 08:12:11,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:12:11,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:12:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:11,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:12:11,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:12:11,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2025-02-08 08:12:11,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 125 flow. Second operand has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:11,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:11,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2025-02-08 08:12:11,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:11,846 INFO L124 PetriNetUnfolderBase]: 22/92 cut-off events. [2025-02-08 08:12:11,846 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 08:12:11,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 92 events. 22/92 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 207 event pairs, 18 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 184. Up to 55 conditions per place. [2025-02-08 08:12:11,847 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 20 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2025-02-08 08:12:11,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 185 flow [2025-02-08 08:12:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:12:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:12:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-02-08 08:12:11,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:12:11,848 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 125 flow. Second operand 8 states and 144 transitions. [2025-02-08 08:12:11,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 185 flow [2025-02-08 08:12:11,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 177 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:11,849 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 141 flow [2025-02-08 08:12:11,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2025-02-08 08:12:11,850 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2025-02-08 08:12:11,850 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 141 flow [2025-02-08 08:12:11,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:11,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:11,850 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-08 08:12:11,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:12,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:12,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-08 08:12:12,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash 156018135, now seen corresponding path program 2 times [2025-02-08 08:12:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899370972] [2025-02-08 08:12:12,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:12,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:12,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:12:12,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:12,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:12:12,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899370972] [2025-02-08 08:12:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899370972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227676657] [2025-02-08 08:12:12,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:12,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:12,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:12,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:12:12,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:12:12,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:12,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:12:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:12,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:12:12,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:12,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:12:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227676657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:12:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-02-08 08:12:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310996565] [2025-02-08 08:12:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:12,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:12:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:12,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:12:12,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:12:12,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-02-08 08:12:12,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:12,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:12,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-02-08 08:12:12,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:12,582 INFO L124 PetriNetUnfolderBase]: 22/90 cut-off events. [2025-02-08 08:12:12,582 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-08 08:12:12,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 90 events. 22/90 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 211 event pairs, 18 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 189. Up to 54 conditions per place. [2025-02-08 08:12:12,583 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 17 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2025-02-08 08:12:12,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 37 transitions, 201 flow [2025-02-08 08:12:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:12:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:12:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-02-08 08:12:12,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2025-02-08 08:12:12,584 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 141 flow. Second operand 8 states and 130 transitions. [2025-02-08 08:12:12,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 37 transitions, 201 flow [2025-02-08 08:12:12,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 175 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-08 08:12:12,586 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 137 flow [2025-02-08 08:12:12,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-02-08 08:12:12,586 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2025-02-08 08:12:12,586 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 137 flow [2025-02-08 08:12:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:12,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:12,587 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-02-08 08:12:12,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:12,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:12,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-08 08:12:12,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash 968638019, now seen corresponding path program 2 times [2025-02-08 08:12:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:12,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154203221] [2025-02-08 08:12:12,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:12,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:12,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 08:12:12,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:12:12,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:12:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:12,815 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:12:12,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:12:12,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:12:12,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:12,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:12,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:12:12,845 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:12:12,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 08:12:12,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-02-08 08:12:12,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-02-08 08:12:12,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-02-08 08:12:12,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-02-08 08:12:12,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-02-08 08:12:12,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-02-08 08:12:12,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-02-08 08:12:12,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-02-08 08:12:12,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-02-08 08:12:12,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:12:12,849 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-02-08 08:12:12,851 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:12:12,851 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:12:12,871 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:12,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 130 flow [2025-02-08 08:12:12,882 INFO L124 PetriNetUnfolderBase]: 7/69 cut-off events. [2025-02-08 08:12:12,882 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:12:12,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 69 events. 7/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 174 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 51. Up to 3 conditions per place. [2025-02-08 08:12:12,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 130 flow [2025-02-08 08:12:12,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 60 transitions, 130 flow [2025-02-08 08:12:12,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:12,884 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;@5f1b379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:12,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 08:12:12,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:12,884 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:12:12,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:12,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:12,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:12,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-08 08:12:12,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:12,885 INFO L85 PathProgramCache]: Analyzing trace with hash 313010, now seen corresponding path program 1 times [2025-02-08 08:12:12,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:12,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-02-08 08:12:12,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:12,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:12,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:12,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:12,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:12,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-02-08 08:12:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252862364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:12,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:12,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420060421] [2025-02-08 08:12:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:12,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:12,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:12,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:12,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-08 08:12:12,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:12,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:12,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-08 08:12:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:13,042 INFO L124 PetriNetUnfolderBase]: 532/1141 cut-off events. [2025-02-08 08:12:13,043 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 08:12:13,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1141 events. 532/1141 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6619 event pairs, 468 based on Foata normal form. 120/1227 useless extension candidates. Maximal degree in co-relation 1222. Up to 866 conditions per place. [2025-02-08 08:12:13,048 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 27 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-02-08 08:12:13,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 162 flow [2025-02-08 08:12:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-02-08 08:12:13,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-08 08:12:13,049 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 130 flow. Second operand 3 states and 99 transitions. [2025-02-08 08:12:13,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 162 flow [2025-02-08 08:12:13,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:13,050 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 108 flow [2025-02-08 08:12:13,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-02-08 08:12:13,051 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2025-02-08 08:12:13,051 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 108 flow [2025-02-08 08:12:13,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:13,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:13,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:13,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:12:13,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-08 08:12:13,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash 313011, now seen corresponding path program 1 times [2025-02-08 08:12:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:13,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701601856] [2025-02-08 08:12:13,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:13,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:13,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:13,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:13,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701601856] [2025-02-08 08:12:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701601856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721764519] [2025-02-08 08:12:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:13,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:13,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-02-08 08:12:13,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:13,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:13,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-02-08 08:12:13,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:13,220 INFO L124 PetriNetUnfolderBase]: 532/1143 cut-off events. [2025-02-08 08:12:13,220 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 08:12:13,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 1143 events. 532/1143 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6604 event pairs, 468 based on Foata normal form. 0/1108 useless extension candidates. Maximal degree in co-relation 2042. Up to 868 conditions per place. [2025-02-08 08:12:13,225 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 29 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-02-08 08:12:13,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 174 flow [2025-02-08 08:12:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-08 08:12:13,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-08 08:12:13,226 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 108 flow. Second operand 3 states and 102 transitions. [2025-02-08 08:12:13,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 174 flow [2025-02-08 08:12:13,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:13,227 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 121 flow [2025-02-08 08:12:13,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-02-08 08:12:13,227 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-02-08 08:12:13,227 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 121 flow [2025-02-08 08:12:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:13,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:13,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:12:13,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:12:13,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-08 08:12:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 300813867, now seen corresponding path program 1 times [2025-02-08 08:12:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193874683] [2025-02-08 08:12:13,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:13,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:13,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:13,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:13,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193874683] [2025-02-08 08:12:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193874683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079747160] [2025-02-08 08:12:13,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:13,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:13,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:13,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:12:13,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:13,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:13,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:13,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:13,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:12:13,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:13,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:12:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:13,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079747160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:12:13,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:12:13,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-02-08 08:12:13,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031431722] [2025-02-08 08:12:13,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:12:13,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:12:13,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:13,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:12:13,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:12:13,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-02-08 08:12:13,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 121 flow. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:13,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:13,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-02-08 08:12:13,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:13,630 INFO L124 PetriNetUnfolderBase]: 534/1151 cut-off events. [2025-02-08 08:12:13,630 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 08:12:13,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1151 events. 534/1151 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6614 event pairs, 468 based on Foata normal form. 1/1118 useless extension candidates. Maximal degree in co-relation 2068. Up to 870 conditions per place. [2025-02-08 08:12:13,634 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 32 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-02-08 08:12:13,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 227 flow [2025-02-08 08:12:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:12:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:12:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-02-08 08:12:13,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5027777777777778 [2025-02-08 08:12:13,636 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 121 flow. Second operand 6 states and 181 transitions. [2025-02-08 08:12:13,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 227 flow [2025-02-08 08:12:13,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:13,637 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 171 flow [2025-02-08 08:12:13,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-02-08 08:12:13,637 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-02-08 08:12:13,638 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 171 flow [2025-02-08 08:12:13,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:13,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:13,638 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-08 08:12:13,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:12:13,842 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,SelfDestructingSolverStorable8 [2025-02-08 08:12:13,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-08 08:12:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 414183571, now seen corresponding path program 2 times [2025-02-08 08:12:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:13,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76873438] [2025-02-08 08:12:13,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:13,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:12:13,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:13,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:12:13,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76873438] [2025-02-08 08:12:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76873438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513831690] [2025-02-08 08:12:13,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:13,978 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:13,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:12:14,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:12:14,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:14,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:12:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:14,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:12:14,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:14,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:12:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513831690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:12:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-02-08 08:12:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314026850] [2025-02-08 08:12:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:14,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:12:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:12:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:12:14,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-02-08 08:12:14,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 171 flow. Second operand has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:14,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:14,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-02-08 08:12:14,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:14,349 INFO L124 PetriNetUnfolderBase]: 534/1150 cut-off events. [2025-02-08 08:12:14,350 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 08:12:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 1150 events. 534/1150 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6610 event pairs, 468 based on Foata normal form. 1/1118 useless extension candidates. Maximal degree in co-relation 2077. Up to 866 conditions per place. [2025-02-08 08:12:14,354 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 28 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2025-02-08 08:12:14,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 245 flow [2025-02-08 08:12:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:12:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:12:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2025-02-08 08:12:14,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46458333333333335 [2025-02-08 08:12:14,356 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 171 flow. Second operand 8 states and 223 transitions. [2025-02-08 08:12:14,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 245 flow [2025-02-08 08:12:14,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 219 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:12:14,357 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 163 flow [2025-02-08 08:12:14,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=163, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-02-08 08:12:14,358 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2025-02-08 08:12:14,358 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 163 flow [2025-02-08 08:12:14,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:14,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:14,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:14,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:14,559 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,SelfDestructingSolverStorable9 [2025-02-08 08:12:14,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-08 08:12:14,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash 431468096, now seen corresponding path program 1 times [2025-02-08 08:12:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:14,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556454] [2025-02-08 08:12:14,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:14,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:14,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:14,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:14,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556454] [2025-02-08 08:12:14,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669191573] [2025-02-08 08:12:14,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:14,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:14,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:14,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:14,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:12:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:14,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:14,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:12:14,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:14,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:12:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:14,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669191573] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:12:14,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:12:14,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 08:12:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216968753] [2025-02-08 08:12:14,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:12:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:12:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:14,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:12:14,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:12:14,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 08:12:14,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:14,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:14,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 08:12:14,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:14,825 INFO L124 PetriNetUnfolderBase]: 532/1151 cut-off events. [2025-02-08 08:12:14,826 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 08:12:14,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1151 events. 532/1151 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6590 event pairs, 468 based on Foata normal form. 4/1122 useless extension candidates. Maximal degree in co-relation 2083. Up to 865 conditions per place. [2025-02-08 08:12:14,832 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 31 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2025-02-08 08:12:14,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 258 flow [2025-02-08 08:12:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:12:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:12:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2025-02-08 08:12:14,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2025-02-08 08:12:14,835 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 163 flow. Second operand 8 states and 235 transitions. [2025-02-08 08:12:14,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 258 flow [2025-02-08 08:12:14,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 240 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 08:12:14,836 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 175 flow [2025-02-08 08:12:14,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-02-08 08:12:14,837 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-02-08 08:12:14,837 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 175 flow [2025-02-08 08:12:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:14,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:14,837 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:14,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:15,037 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,SelfDestructingSolverStorable10 [2025-02-08 08:12:15,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-08 08:12:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash 151713824, now seen corresponding path program 2 times [2025-02-08 08:12:15,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:15,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125597176] [2025-02-08 08:12:15,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:15,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:15,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 08:12:15,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-02-08 08:12:15,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:12:15,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 08:12:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125597176] [2025-02-08 08:12:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125597176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:15,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:15,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:12:15,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859357472] [2025-02-08 08:12:15,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:15,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:12:15,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:15,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:12:15,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:12:15,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-02-08 08:12:15,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:15,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:15,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-02-08 08:12:15,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:15,334 INFO L124 PetriNetUnfolderBase]: 744/1602 cut-off events. [2025-02-08 08:12:15,335 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 08:12:15,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2910 conditions, 1602 events. 744/1602 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9713 event pairs, 518 based on Foata normal form. 33/1581 useless extension candidates. Maximal degree in co-relation 2896. Up to 963 conditions per place. [2025-02-08 08:12:15,342 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 60 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-02-08 08:12:15,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 371 flow [2025-02-08 08:12:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:12:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:12:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-02-08 08:12:15,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-08 08:12:15,344 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 175 flow. Second operand 5 states and 170 transitions. [2025-02-08 08:12:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 371 flow [2025-02-08 08:12:15,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:12:15,347 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 194 flow [2025-02-08 08:12:15,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-02-08 08:12:15,347 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-02-08 08:12:15,347 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 194 flow [2025-02-08 08:12:15,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:15,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:15,347 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 08:12:15,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:12:15,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-08 08:12:15,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 238203297, now seen corresponding path program 1 times [2025-02-08 08:12:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801978861] [2025-02-08 08:12:15,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:15,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:12:15,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:12:15,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:15,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:15,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:12:15,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:12:15,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:12:15,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:15,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:15,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:12:15,388 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:12:15,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 08:12:15,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-02-08 08:12:15,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-02-08 08:12:15,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-02-08 08:12:15,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-02-08 08:12:15,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:12:15,389 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-02-08 08:12:15,390 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:12:15,390 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:12:15,409 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:15,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 84 transitions, 186 flow [2025-02-08 08:12:15,416 INFO L124 PetriNetUnfolderBase]: 10/98 cut-off events. [2025-02-08 08:12:15,416 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:12:15,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 98 events. 10/98 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 308 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2025-02-08 08:12:15,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 84 transitions, 186 flow [2025-02-08 08:12:15,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 84 transitions, 186 flow [2025-02-08 08:12:15,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:15,417 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;@5f1b379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:15,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:12:15,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:15,418 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:12:15,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:15,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:15,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:15,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 396422, now seen corresponding path program 1 times [2025-02-08 08:12:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657061341] [2025-02-08 08:12:15,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:15,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:15,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:15,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:15,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657061341] [2025-02-08 08:12:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657061341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553417684] [2025-02-08 08:12:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:15,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:15,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:15,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:15,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 84 [2025-02-08 08:12:15,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:15,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:15,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 84 [2025-02-08 08:12:15,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:16,358 INFO L124 PetriNetUnfolderBase]: 8632/14452 cut-off events. [2025-02-08 08:12:16,359 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-02-08 08:12:16,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26855 conditions, 14452 events. 8632/14452 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 107248 event pairs, 7668 based on Foata normal form. 1823/15851 useless extension candidates. Maximal degree in co-relation 2702. Up to 11966 conditions per place. [2025-02-08 08:12:16,423 INFO L140 encePairwiseOnDemand]: 72/84 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2025-02-08 08:12:16,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 232 flow [2025-02-08 08:12:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-02-08 08:12:16,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-08 08:12:16,424 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 186 flow. Second operand 3 states and 140 transitions. [2025-02-08 08:12:16,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 232 flow [2025-02-08 08:12:16,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:16,426 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 154 flow [2025-02-08 08:12:16,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-02-08 08:12:16,427 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2025-02-08 08:12:16,427 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 154 flow [2025-02-08 08:12:16,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:16,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:16,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:12:16,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:16,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash 396423, now seen corresponding path program 1 times [2025-02-08 08:12:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559499804] [2025-02-08 08:12:16,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:16,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:16,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:16,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:16,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559499804] [2025-02-08 08:12:16,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559499804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:16,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:16,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:16,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198074340] [2025-02-08 08:12:16,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:16,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:16,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:16,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:16,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 84 [2025-02-08 08:12:16,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:16,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:16,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 84 [2025-02-08 08:12:16,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:17,226 INFO L124 PetriNetUnfolderBase]: 8632/14454 cut-off events. [2025-02-08 08:12:17,227 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-02-08 08:12:17,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26762 conditions, 14454 events. 8632/14454 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 107176 event pairs, 7668 based on Foata normal form. 0/14029 useless extension candidates. Maximal degree in co-relation 26753. Up to 11968 conditions per place. [2025-02-08 08:12:17,288 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 40 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-02-08 08:12:17,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 242 flow [2025-02-08 08:12:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2025-02-08 08:12:17,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2025-02-08 08:12:17,289 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 154 flow. Second operand 3 states and 143 transitions. [2025-02-08 08:12:17,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 242 flow [2025-02-08 08:12:17,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:17,291 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 167 flow [2025-02-08 08:12:17,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-02-08 08:12:17,292 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -6 predicate places. [2025-02-08 08:12:17,292 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 167 flow [2025-02-08 08:12:17,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:17,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:17,292 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:12:17,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:12:17,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash 380975487, now seen corresponding path program 1 times [2025-02-08 08:12:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040831569] [2025-02-08 08:12:17,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:17,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:17,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:17,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040831569] [2025-02-08 08:12:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040831569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60397746] [2025-02-08 08:12:17,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:17,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:17,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:17,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:12:17,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:17,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:17,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:17,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:17,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:12:17,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:17,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:12:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:17,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60397746] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:12:17,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:12:17,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-02-08 08:12:17,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975498598] [2025-02-08 08:12:17,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:12:17,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:12:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:17,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:12:17,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:12:17,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 84 [2025-02-08 08:12:17,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 167 flow. Second operand has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:17,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:17,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 84 [2025-02-08 08:12:17,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:18,359 INFO L124 PetriNetUnfolderBase]: 8634/14462 cut-off events. [2025-02-08 08:12:18,360 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-02-08 08:12:18,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26790 conditions, 14462 events. 8634/14462 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 107166 event pairs, 7668 based on Foata normal form. 1/14039 useless extension candidates. Maximal degree in co-relation 26779. Up to 11970 conditions per place. [2025-02-08 08:12:18,413 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 43 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2025-02-08 08:12:18,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 295 flow [2025-02-08 08:12:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:12:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:12:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 252 transitions. [2025-02-08 08:12:18,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:12:18,418 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 167 flow. Second operand 6 states and 252 transitions. [2025-02-08 08:12:18,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 295 flow [2025-02-08 08:12:18,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:18,420 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 217 flow [2025-02-08 08:12:18,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-02-08 08:12:18,420 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2025-02-08 08:12:18,420 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 217 flow [2025-02-08 08:12:18,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:18,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:18,420 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-08 08:12:18,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 08:12:18,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:18,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:18,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -942371737, now seen corresponding path program 2 times [2025-02-08 08:12:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:18,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716106345] [2025-02-08 08:12:18,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:18,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:12:18,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:18,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:12:18,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:18,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:18,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716106345] [2025-02-08 08:12:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716106345] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:18,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483079040] [2025-02-08 08:12:18,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:18,741 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:18,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:12:18,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:12:18,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:18,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:12:18,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:18,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:12:18,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:18,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:12:18,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483079040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:18,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:12:18,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-02-08 08:12:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158353472] [2025-02-08 08:12:18,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:18,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:12:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:18,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:12:18,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:12:18,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 84 [2025-02-08 08:12:18,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:18,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:18,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 84 [2025-02-08 08:12:18,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:19,723 INFO L124 PetriNetUnfolderBase]: 8634/14461 cut-off events. [2025-02-08 08:12:19,723 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-02-08 08:12:19,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26803 conditions, 14461 events. 8634/14461 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 107199 event pairs, 7668 based on Foata normal form. 1/14039 useless extension candidates. Maximal degree in co-relation 26788. Up to 11966 conditions per place. [2025-02-08 08:12:19,784 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 39 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2025-02-08 08:12:19,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 313 flow [2025-02-08 08:12:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:12:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:12:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 314 transitions. [2025-02-08 08:12:19,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-02-08 08:12:19,786 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 217 flow. Second operand 8 states and 314 transitions. [2025-02-08 08:12:19,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 313 flow [2025-02-08 08:12:19,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 77 transitions, 287 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:12:19,788 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 209 flow [2025-02-08 08:12:19,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-02-08 08:12:19,789 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2025-02-08 08:12:19,789 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 209 flow [2025-02-08 08:12:19,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:19,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:19,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:19,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:19,991 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,SelfDestructingSolverStorable16 [2025-02-08 08:12:19,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:19,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash -924402019, now seen corresponding path program 1 times [2025-02-08 08:12:19,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573657433] [2025-02-08 08:12:19,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:19,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:20,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:20,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:20,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573657433] [2025-02-08 08:12:20,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573657433] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016756732] [2025-02-08 08:12:20,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:20,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:20,037 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:20,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:12:20,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:12:20,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:12:20,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:20,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:20,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:12:20,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:20,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:12:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:20,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016756732] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:12:20,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:12:20,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 08:12:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576701890] [2025-02-08 08:12:20,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:12:20,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:12:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:20,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:12:20,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:12:20,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-02-08 08:12:20,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 209 flow. Second operand has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:20,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:20,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-02-08 08:12:20,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:21,190 INFO L124 PetriNetUnfolderBase]: 8632/14462 cut-off events. [2025-02-08 08:12:21,190 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2025-02-08 08:12:21,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26807 conditions, 14462 events. 8632/14462 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 107234 event pairs, 7668 based on Foata normal form. 4/14043 useless extension candidates. Maximal degree in co-relation 26794. Up to 11965 conditions per place. [2025-02-08 08:12:21,233 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 42 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2025-02-08 08:12:21,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 78 transitions, 326 flow [2025-02-08 08:12:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:12:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:12:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 326 transitions. [2025-02-08 08:12:21,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2025-02-08 08:12:21,235 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 209 flow. Second operand 8 states and 326 transitions. [2025-02-08 08:12:21,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 78 transitions, 326 flow [2025-02-08 08:12:21,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 78 transitions, 308 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 08:12:21,236 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 221 flow [2025-02-08 08:12:21,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2025-02-08 08:12:21,237 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 7 predicate places. [2025-02-08 08:12:21,237 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 221 flow [2025-02-08 08:12:21,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:21,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:21,237 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:21,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:12:21,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1851302275, now seen corresponding path program 2 times [2025-02-08 08:12:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460095580] [2025-02-08 08:12:21,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:12:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:21,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 08:12:21,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-02-08 08:12:21,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:12:21,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 08:12:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460095580] [2025-02-08 08:12:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460095580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:21,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:12:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915699633] [2025-02-08 08:12:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:21,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:12:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:21,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:12:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:12:21,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-02-08 08:12:21,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:21,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:21,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-02-08 08:12:21,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:22,601 INFO L124 PetriNetUnfolderBase]: 12084/20543 cut-off events. [2025-02-08 08:12:22,602 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-02-08 08:12:22,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37812 conditions, 20543 events. 12084/20543 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 161849 event pairs, 8468 based on Foata normal form. 333/20155 useless extension candidates. Maximal degree in co-relation 37797. Up to 13173 conditions per place. [2025-02-08 08:12:22,692 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 93 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-02-08 08:12:22,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 537 flow [2025-02-08 08:12:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:12:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:12:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 253 transitions. [2025-02-08 08:12:22,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6023809523809524 [2025-02-08 08:12:22,694 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 221 flow. Second operand 5 states and 253 transitions. [2025-02-08 08:12:22,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 537 flow [2025-02-08 08:12:22,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 124 transitions, 529 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:12:22,696 INFO L231 Difference]: Finished difference. Result has 90 places, 76 transitions, 240 flow [2025-02-08 08:12:22,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=90, PETRI_TRANSITIONS=76} [2025-02-08 08:12:22,696 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2025-02-08 08:12:22,696 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 240 flow [2025-02-08 08:12:22,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:22,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:22,697 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:12:22,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:22,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1632928199, now seen corresponding path program 1 times [2025-02-08 08:12:22,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:22,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865126426] [2025-02-08 08:12:22,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:22,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:12:22,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:12:22,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:22,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 08:12:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865126426] [2025-02-08 08:12:22,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865126426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:22,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:22,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:12:22,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429876186] [2025-02-08 08:12:22,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:22,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:12:22,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:22,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:12:22,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:12:22,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-02-08 08:12:22,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:22,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:22,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-02-08 08:12:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:24,165 INFO L124 PetriNetUnfolderBase]: 14486/24521 cut-off events. [2025-02-08 08:12:24,165 INFO L125 PetriNetUnfolderBase]: For 5656/5656 co-relation queries the response was YES. [2025-02-08 08:12:24,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48932 conditions, 24521 events. 14486/24521 cut-off events. For 5656/5656 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 195178 event pairs, 10231 based on Foata normal form. 396/24158 useless extension candidates. Maximal degree in co-relation 48914. Up to 15797 conditions per place. [2025-02-08 08:12:24,262 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 97 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-02-08 08:12:24,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 590 flow [2025-02-08 08:12:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:12:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:12:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-02-08 08:12:24,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5976190476190476 [2025-02-08 08:12:24,263 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 240 flow. Second operand 5 states and 251 transitions. [2025-02-08 08:12:24,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 590 flow [2025-02-08 08:12:24,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 128 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:24,266 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 266 flow [2025-02-08 08:12:24,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-02-08 08:12:24,267 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 14 predicate places. [2025-02-08 08:12:24,267 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 266 flow [2025-02-08 08:12:24,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:24,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:24,267 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:24,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:12:24,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash -470587903, now seen corresponding path program 1 times [2025-02-08 08:12:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835086513] [2025-02-08 08:12:24,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:24,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:12:24,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:12:24,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:24,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 08:12:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835086513] [2025-02-08 08:12:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835086513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:12:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467746216] [2025-02-08 08:12:24,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:24,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:24,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:24,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:12:24,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:12:24,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:12:24,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:12:24,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:24,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:24,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:12:24,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:12:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 08:12:24,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:12:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 08:12:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467746216] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:12:24,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:12:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:12:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593607377] [2025-02-08 08:12:24,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:12:24,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:12:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:24,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:12:24,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:12:24,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-02-08 08:12:24,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 266 flow. Second operand has 11 states, 11 states have (on average 34.72727272727273) internal successors, (382), 11 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:24,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:24,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-02-08 08:12:24,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:27,757 INFO L124 PetriNetUnfolderBase]: 24206/41126 cut-off events. [2025-02-08 08:12:27,758 INFO L125 PetriNetUnfolderBase]: For 13668/13668 co-relation queries the response was YES. [2025-02-08 08:12:27,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87284 conditions, 41126 events. 24206/41126 cut-off events. For 13668/13668 co-relation queries the response was YES. Maximal size of possible extension queue 1315. Compared 353048 event pairs, 9334 based on Foata normal form. 399/41084 useless extension candidates. Maximal degree in co-relation 87263. Up to 16190 conditions per place. [2025-02-08 08:12:27,970 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 133 selfloop transitions, 7 changer transitions 0/166 dead transitions. [2025-02-08 08:12:27,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 166 transitions, 808 flow [2025-02-08 08:12:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:12:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:12:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 318 transitions. [2025-02-08 08:12:27,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-02-08 08:12:27,972 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 266 flow. Second operand 6 states and 318 transitions. [2025-02-08 08:12:27,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 166 transitions, 808 flow [2025-02-08 08:12:27,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 166 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:27,981 INFO L231 Difference]: Finished difference. Result has 101 places, 81 transitions, 306 flow [2025-02-08 08:12:27,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=101, PETRI_TRANSITIONS=81} [2025-02-08 08:12:27,981 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 20 predicate places. [2025-02-08 08:12:27,982 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 81 transitions, 306 flow [2025-02-08 08:12:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.72727272727273) internal successors, (382), 11 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:27,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:27,982 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:27,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 08:12:28,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:12:28,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-08 08:12:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 688255058, now seen corresponding path program 1 times [2025-02-08 08:12:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792884255] [2025-02-08 08:12:28,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:28,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:12:28,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:12:28,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:28,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:28,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:12:28,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:12:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:12:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:28,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:12:28,216 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-02-08 08:12:28,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-02-08 08:12:28,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-08 08:12:28,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-08 08:12:28,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-02-08 08:12:28,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-08 08:12:28,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-08 08:12:28,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-02-08 08:12:28,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 08:12:28,217 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-02-08 08:12:28,217 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:12:28,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:12:28,241 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:28,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 244 flow [2025-02-08 08:12:28,247 INFO L124 PetriNetUnfolderBase]: 13/127 cut-off events. [2025-02-08 08:12:28,247 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:12:28,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 127 events. 13/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 455 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 106. Up to 5 conditions per place. [2025-02-08 08:12:28,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 244 flow [2025-02-08 08:12:28,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 244 flow [2025-02-08 08:12:28,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:28,251 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;@5f1b379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:28,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 08:12:28,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:28,252 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:12:28,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:28,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:28,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:28,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-02-08 08:12:28,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 503666, now seen corresponding path program 1 times [2025-02-08 08:12:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271486682] [2025-02-08 08:12:28,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:28,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:28,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:28,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271486682] [2025-02-08 08:12:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271486682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:28,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:28,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:28,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807211788] [2025-02-08 08:12:28,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:28,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:28,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:28,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:28,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 108 [2025-02-08 08:12:28,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:28,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:28,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 108 [2025-02-08 08:12:28,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:37,939 INFO L124 PetriNetUnfolderBase]: 119632/176646 cut-off events. [2025-02-08 08:12:37,939 INFO L125 PetriNetUnfolderBase]: For 12416/12416 co-relation queries the response was YES. [2025-02-08 08:12:38,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335050 conditions, 176646 events. 119632/176646 cut-off events. For 12416/12416 co-relation queries the response was YES. Maximal size of possible extension queue 4924. Compared 1470190 event pairs, 106668 based on Foata normal form. 24788/197022 useless extension candidates. Maximal degree in co-relation 26962. Up to 152966 conditions per place. [2025-02-08 08:12:38,766 INFO L140 encePairwiseOnDemand]: 93/108 looper letters, 49 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2025-02-08 08:12:38,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 304 flow [2025-02-08 08:12:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-02-08 08:12:38,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.558641975308642 [2025-02-08 08:12:38,767 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 244 flow. Second operand 3 states and 181 transitions. [2025-02-08 08:12:38,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 304 flow [2025-02-08 08:12:38,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 88 transitions, 298 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:38,772 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 200 flow [2025-02-08 08:12:38,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2025-02-08 08:12:38,772 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2025-02-08 08:12:38,772 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 200 flow [2025-02-08 08:12:38,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:38,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:38,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:38,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:12:38,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-02-08 08:12:38,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 503667, now seen corresponding path program 1 times [2025-02-08 08:12:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715399939] [2025-02-08 08:12:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:38,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:38,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:38,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:38,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715399939] [2025-02-08 08:12:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715399939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:38,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:38,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669711818] [2025-02-08 08:12:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:38,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:38,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:38,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:38,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 108 [2025-02-08 08:12:38,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:12:38,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:38,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 108 [2025-02-08 08:12:38,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand