./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/09_fmaxsym.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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:35:58,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:35:58,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:35:58,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:35:58,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:35:58,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:35:58,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:35:58,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:35:58,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:35:58,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:35:58,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:35:58,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:35:58,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:35:58,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:35:58,699 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:35:58,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:35:58,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:35:58,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:35:58,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:58,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:35:58,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:35:58,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:35:58,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:35:58,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:35:58,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:35:58,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:35:58,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:35:58,702 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-02-06 12:35:58,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:35:58,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:35:58,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:35:58,962 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:35:58,963 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:35:58,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-06 12:36:00,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/449bf46b5/ff05640fddbe4ea08f4bf05bf5337c49/FLAG6639edafd [2025-02-06 12:36:00,404 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:36:00,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-06 12:36:00,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/449bf46b5/ff05640fddbe4ea08f4bf05bf5337c49/FLAG6639edafd [2025-02-06 12:36:00,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/449bf46b5/ff05640fddbe4ea08f4bf05bf5337c49 [2025-02-06 12:36:00,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:36:00,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:36:00,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:36:00,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:36:00,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:36:00,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126ad240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00, skipping insertion in model container [2025-02-06 12:36:00,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:36:00,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:36:00,753 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:36:00,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:36:00,812 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:36:00,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00 WrapperNode [2025-02-06 12:36:00,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:36:00,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:36:00,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:36:00,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:36:00,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,845 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2025-02-06 12:36:00,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:36:00,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:36:00,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:36:00,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:36:00,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,871 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-06 12:36:00,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:36:00,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:36:00,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:36:00,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:36:00,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (1/1) ... [2025-02-06 12:36:00,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:36:00,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:00,912 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-06 12:36:00,915 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-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:36:00,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:36:00,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:36:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:36:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:36:00,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:36:00,934 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:36:01,042 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:36:01,044 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:36:01,236 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:36:01,236 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:36:01,353 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:36:01,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:36:01,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:01 BoogieIcfgContainer [2025-02-06 12:36:01,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:36:01,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:36:01,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:36:01,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:36:01,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:36:00" (1/3) ... [2025-02-06 12:36:01,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6460b042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:01, skipping insertion in model container [2025-02-06 12:36:01,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:00" (2/3) ... [2025-02-06 12:36:01,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6460b042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:01, skipping insertion in model container [2025-02-06 12:36:01,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:01" (3/3) ... [2025-02-06 12:36:01,362 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-02-06 12:36:01,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:36:01,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-06 12:36:01,374 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:36:01,411 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:01,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 72 flow [2025-02-06 12:36:01,462 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-02-06 12:36:01,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:01,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 38 events. 4/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 55 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-02-06 12:36:01,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 72 flow [2025-02-06 12:36:01,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 34 transitions, 72 flow [2025-02-06 12:36:01,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:01,483 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;@634bcc23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:01,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 12:36:01,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:01,486 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 12:36:01,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:01,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:01,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:01,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-06 12:36:01,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash 235522, now seen corresponding path program 1 times [2025-02-06 12:36:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:01,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171925319] [2025-02-06 12:36:01,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:01,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:01,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:01,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:01,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:01,742 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-06 12:36:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171925319] [2025-02-06 12:36:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171925319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037696372] [2025-02-06 12:36:01,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:01,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:01,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:01,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:01,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-02-06 12:36:01,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:36:01,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:01,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-02-06 12:36:01,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:01,848 INFO L124 PetriNetUnfolderBase]: 22/79 cut-off events. [2025-02-06 12:36:01,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:01,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 79 events. 22/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 175 event pairs, 18 based on Foata normal form. 6/84 useless extension candidates. Maximal degree in co-relation 121. Up to 56 conditions per place. [2025-02-06 12:36:01,851 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 16 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-02-06 12:36:01,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 90 flow [2025-02-06 12:36:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-02-06 12:36:01,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2025-02-06 12:36:01,861 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 72 flow. Second operand 3 states and 52 transitions. [2025-02-06 12:36:01,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 90 flow [2025-02-06 12:36:01,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:01,865 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 58 flow [2025-02-06 12:36:01,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-02-06 12:36:01,872 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2025-02-06 12:36:01,872 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 58 flow [2025-02-06 12:36:01,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06 12:36:01,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:01,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:01,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:36:01,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-06 12:36:01,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash 235523, now seen corresponding path program 1 times [2025-02-06 12:36:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348388604] [2025-02-06 12:36:01,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:01,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:01,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:01,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:01,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:02,003 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-06 12:36:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348388604] [2025-02-06 12:36:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348388604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:02,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264109322] [2025-02-06 12:36:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:02,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:02,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:02,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:02,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-02-06 12:36:02,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06 12:36:02,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:02,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-02-06 12:36:02,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:02,070 INFO L124 PetriNetUnfolderBase]: 22/81 cut-off events. [2025-02-06 12:36:02,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:02,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 81 events. 22/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 175 event pairs, 18 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 140. Up to 58 conditions per place. [2025-02-06 12:36:02,071 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 18 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-02-06 12:36:02,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 102 flow [2025-02-06 12:36:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-06 12:36:02,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-02-06 12:36:02,073 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 58 flow. Second operand 3 states and 55 transitions. [2025-02-06 12:36:02,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 102 flow [2025-02-06 12:36:02,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 101 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:02,074 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 71 flow [2025-02-06 12:36:02,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2025-02-06 12:36:02,075 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-02-06 12:36:02,075 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 71 flow [2025-02-06 12:36:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06 12:36:02,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:02,075 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 12:36:02,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:36:02,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-06 12:36:02,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 226345369, now seen corresponding path program 1 times [2025-02-06 12:36:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340012163] [2025-02-06 12:36:02,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:02,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:36:02,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:36:02,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:02,228 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-06 12:36:02,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:02,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340012163] [2025-02-06 12:36:02,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340012163] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:02,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028343691] [2025-02-06 12:36:02,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:02,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:02,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:02,233 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-06 12:36:02,234 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-06 12:36:02,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:36:02,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:36:02,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:02,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:36:02,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:02,369 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-06 12:36:02,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:02,423 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-06 12:36:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028343691] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:02,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-02-06 12:36:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727162852] [2025-02-06 12:36:02,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:02,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:02,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:36:02,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-02-06 12:36:02,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 71 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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-06 12:36:02,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:02,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-02-06 12:36:02,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:02,616 INFO L124 PetriNetUnfolderBase]: 24/89 cut-off events. [2025-02-06 12:36:02,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:02,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 89 events. 24/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 18 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 166. Up to 60 conditions per place. [2025-02-06 12:36:02,617 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 21 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-02-06 12:36:02,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 155 flow [2025-02-06 12:36:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:36:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:36:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-02-06 12:36:02,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-02-06 12:36:02,619 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 71 flow. Second operand 6 states and 98 transitions. [2025-02-06 12:36:02,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 155 flow [2025-02-06 12:36:02,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:02,620 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2025-02-06 12:36:02,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-02-06 12:36:02,621 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-02-06 12:36:02,621 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2025-02-06 12:36:02,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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-06 12:36:02,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:02,621 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 12:36:02,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:36:02,826 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-06 12:36:02,826 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-06 12:36:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 433147620, now seen corresponding path program 1 times [2025-02-06 12:36:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828374451] [2025-02-06 12:36:02,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:02,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:36:02,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:02,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:02,895 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-06 12:36:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828374451] [2025-02-06 12:36:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828374451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879386292] [2025-02-06 12:36:02,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:02,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:02,898 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-06 12:36:02,899 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-06 12:36:02,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:36:02,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:02,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:02,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:36:02,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:02,974 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-06 12:36:02,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:03,001 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-06 12:36:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879386292] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:03,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:03,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 12:36:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707310338] [2025-02-06 12:36:03,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:03,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:36:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:03,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:36:03,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:36:03,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-02-06 12:36:03,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 121 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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-06 12:36:03,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:03,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-02-06 12:36:03,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:03,092 INFO L124 PetriNetUnfolderBase]: 22/91 cut-off events. [2025-02-06 12:36:03,092 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 12:36:03,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 91 events. 22/91 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 174 event pairs, 18 based on Foata normal form. 4/95 useless extension candidates. Maximal degree in co-relation 183. Up to 55 conditions per place. [2025-02-06 12:36:03,093 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 20 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2025-02-06 12:36:03,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 181 flow [2025-02-06 12:36:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:36:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:36:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-02-06 12:36:03,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-02-06 12:36:03,096 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 8 states and 128 transitions. [2025-02-06 12:36:03,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 181 flow [2025-02-06 12:36:03,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 173 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:03,099 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 137 flow [2025-02-06 12:36:03,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2025-02-06 12:36:03,101 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2025-02-06 12:36:03,101 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 137 flow [2025-02-06 12:36:03,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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-06 12:36:03,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:03,102 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-06 12:36:03,108 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-06 12:36:03,302 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-06 12:36:03,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-02-06 12:36:03,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:03,304 INFO L85 PathProgramCache]: Analyzing trace with hash 401698139, now seen corresponding path program 2 times [2025-02-06 12:36:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:03,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196527983] [2025-02-06 12:36:03,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:03,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 12:36:03,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:03,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:03,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:03,506 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-06 12:36:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196527983] [2025-02-06 12:36:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196527983] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545143490] [2025-02-06 12:36:03,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:03,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:03,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:03,510 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-06 12:36:03,512 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-06 12:36:03,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 12:36:03,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:03,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:03,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:03,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 12:36:03,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:03,728 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-06 12:36:03,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545143490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:03,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:36:03,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-02-06 12:36:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613526345] [2025-02-06 12:36:03,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:03,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:03,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:36:03,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-02-06 12:36:03,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 137 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:03,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:03,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-02-06 12:36:03,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:03,852 INFO L124 PetriNetUnfolderBase]: 22/89 cut-off events. [2025-02-06 12:36:03,853 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-06 12:36:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 89 events. 22/89 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 18 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 188. Up to 54 conditions per place. [2025-02-06 12:36:03,853 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 17 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2025-02-06 12:36:03,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 35 transitions, 197 flow [2025-02-06 12:36:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:36:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:36:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2025-02-06 12:36:03,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41911764705882354 [2025-02-06 12:36:03,855 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 137 flow. Second operand 8 states and 114 transitions. [2025-02-06 12:36:03,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 35 transitions, 197 flow [2025-02-06 12:36:03,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 171 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-06 12:36:03,858 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 133 flow [2025-02-06 12:36:03,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2025-02-06 12:36:03,858 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2025-02-06 12:36:03,858 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 133 flow [2025-02-06 12:36:03,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:03,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:03,859 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-02-06 12:36:03,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:36:04,059 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-06 12:36:04,060 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-06 12:36:04,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash -593474500, now seen corresponding path program 2 times [2025-02-06 12:36:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273229577] [2025-02-06 12:36:04,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:04,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 12:36:04,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:36:04,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:04,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:04,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:04,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:36:04,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:36:04,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:04,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:04,110 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:04,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 12:36:04,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-02-06 12:36:04,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-02-06 12:36:04,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-02-06 12:36:04,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-02-06 12:36:04,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-02-06 12:36:04,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-02-06 12:36:04,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-02-06 12:36:04,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-02-06 12:36:04,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-02-06 12:36:04,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:36:04,113 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-02-06 12:36:04,115 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:04,115 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:36:04,135 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:04,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 122 flow [2025-02-06 12:36:04,146 INFO L124 PetriNetUnfolderBase]: 7/65 cut-off events. [2025-02-06 12:36:04,146 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:36:04,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 65 events. 7/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-02-06 12:36:04,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 122 flow [2025-02-06 12:36:04,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 122 flow [2025-02-06 12:36:04,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:04,149 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;@634bcc23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:04,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 12:36:04,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:04,151 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 12:36:04,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:04,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:04,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:04,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-06 12:36:04,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash 291130, now seen corresponding path program 1 times [2025-02-06 12:36:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638038432] [2025-02-06 12:36:04,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:04,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:04,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:04,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:04,183 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-06 12:36:04,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638038432] [2025-02-06 12:36:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638038432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:04,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531580999] [2025-02-06 12:36:04,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:04,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:04,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:04,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:04,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-02-06 12:36:04,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-06 12:36:04,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:04,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-02-06 12:36:04,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:04,328 INFO L124 PetriNetUnfolderBase]: 532/1122 cut-off events. [2025-02-06 12:36:04,329 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 12:36:04,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 1122 events. 532/1122 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6115 event pairs, 468 based on Foata normal form. 123/1228 useless extension candidates. Maximal degree in co-relation 1291. Up to 866 conditions per place. [2025-02-06 12:36:04,337 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 27 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-02-06 12:36:04,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 154 flow [2025-02-06 12:36:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-02-06 12:36:04,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-02-06 12:36:04,339 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 122 flow. Second operand 3 states and 87 transitions. [2025-02-06 12:36:04,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 154 flow [2025-02-06 12:36:04,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:04,341 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 100 flow [2025-02-06 12:36:04,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-02-06 12:36:04,341 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-02-06 12:36:04,342 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 100 flow [2025-02-06 12:36:04,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-06 12:36:04,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:04,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:04,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:36:04,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-06 12:36:04,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:04,342 INFO L85 PathProgramCache]: Analyzing trace with hash 291131, now seen corresponding path program 1 times [2025-02-06 12:36:04,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:04,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940467402] [2025-02-06 12:36:04,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:04,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:04,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:04,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:04,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:04,383 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-06 12:36:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940467402] [2025-02-06 12:36:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940467402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:04,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:04,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223362773] [2025-02-06 12:36:04,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:04,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:04,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:04,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:04,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:04,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-02-06 12:36:04,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:04,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-02-06 12:36:04,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:04,526 INFO L124 PetriNetUnfolderBase]: 532/1124 cut-off events. [2025-02-06 12:36:04,527 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 12:36:04,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 1124 events. 532/1124 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6110 event pairs, 468 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 2023. Up to 868 conditions per place. [2025-02-06 12:36:04,531 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-02-06 12:36:04,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 166 flow [2025-02-06 12:36:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-06 12:36:04,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-02-06 12:36:04,533 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 100 flow. Second operand 3 states and 90 transitions. [2025-02-06 12:36:04,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 166 flow [2025-02-06 12:36:04,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:04,534 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 113 flow [2025-02-06 12:36:04,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-02-06 12:36:04,534 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-02-06 12:36:04,535 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 113 flow [2025-02-06 12:36:04,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:04,535 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 12:36:04,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:36:04,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-06 12:36:04,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 279786449, now seen corresponding path program 1 times [2025-02-06 12:36:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140437336] [2025-02-06 12:36:04,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:04,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:36:04,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:36:04,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:04,596 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-06 12:36:04,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:04,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140437336] [2025-02-06 12:36:04,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140437336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:04,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106836963] [2025-02-06 12:36:04,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:04,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:04,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:04,598 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-06 12:36:04,600 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-06 12:36:04,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:36:04,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:36:04,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:04,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:04,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:36:04,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:04,702 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-06 12:36:04,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:04,743 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-06 12:36:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106836963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:04,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-02-06 12:36:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100871053] [2025-02-06 12:36:04,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:36:04,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-02-06 12:36:04,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 113 flow. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:04,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:04,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-02-06 12:36:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:05,009 INFO L124 PetriNetUnfolderBase]: 534/1132 cut-off events. [2025-02-06 12:36:05,010 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 12:36:05,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 1132 events. 534/1132 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6140 event pairs, 468 based on Foata normal form. 1/1116 useless extension candidates. Maximal degree in co-relation 2049. Up to 870 conditions per place. [2025-02-06 12:36:05,016 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 32 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-02-06 12:36:05,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 219 flow [2025-02-06 12:36:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:36:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:36:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-02-06 12:36:05,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-02-06 12:36:05,017 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 113 flow. Second operand 6 states and 157 transitions. [2025-02-06 12:36:05,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 219 flow [2025-02-06 12:36:05,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:05,019 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 163 flow [2025-02-06 12:36:05,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-02-06 12:36:05,019 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-02-06 12:36:05,019 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 163 flow [2025-02-06 12:36:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:05,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:05,020 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:05,030 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-06 12:36:05,220 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-06 12:36:05,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-06 12:36:05,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 961110038, now seen corresponding path program 1 times [2025-02-06 12:36:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913517089] [2025-02-06 12:36:05,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:05,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:36:05,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:05,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:05,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:05,269 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-06 12:36:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913517089] [2025-02-06 12:36:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913517089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832493579] [2025-02-06 12:36:05,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:05,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:05,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:05,273 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-06 12:36:05,274 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-06 12:36:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:36:05,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:05,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:05,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:05,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:36:05,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:05,352 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-06 12:36:05,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:05,375 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-06 12:36:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832493579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:05,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:05,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 12:36:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216476999] [2025-02-06 12:36:05,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:05,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:36:05,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:05,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:36:05,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:36:05,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-02-06 12:36:05,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 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-06 12:36:05,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:05,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-02-06 12:36:05,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:05,566 INFO L124 PetriNetUnfolderBase]: 532/1134 cut-off events. [2025-02-06 12:36:05,566 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-06 12:36:05,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 1134 events. 532/1134 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6111 event pairs, 468 based on Foata normal form. 4/1122 useless extension candidates. Maximal degree in co-relation 2066. Up to 865 conditions per place. [2025-02-06 12:36:05,574 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2025-02-06 12:36:05,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 245 flow [2025-02-06 12:36:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:36:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:36:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-02-06 12:36:05,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-02-06 12:36:05,577 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 163 flow. Second operand 8 states and 203 transitions. [2025-02-06 12:36:05,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 245 flow [2025-02-06 12:36:05,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 237 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:05,579 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 179 flow [2025-02-06 12:36:05,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2025-02-06 12:36:05,580 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2025-02-06 12:36:05,580 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 179 flow [2025-02-06 12:36:05,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 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-06 12:36:05,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:05,581 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-06 12:36:05,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:36:05,785 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-06 12:36:05,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-06 12:36:05,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:05,785 INFO L85 PathProgramCache]: Analyzing trace with hash 928983699, now seen corresponding path program 2 times [2025-02-06 12:36:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:05,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672004286] [2025-02-06 12:36:05,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:05,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:05,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 12:36:05,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:05,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:05,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:05,947 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-06 12:36:05,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672004286] [2025-02-06 12:36:05,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672004286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962003534] [2025-02-06 12:36:05,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:05,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:05,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:05,949 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-06 12:36:05,951 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-06 12:36:05,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 12:36:05,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:05,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:05,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:06,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 12:36:06,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:06,128 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-06 12:36:06,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962003534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:06,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:36:06,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-02-06 12:36:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659911326] [2025-02-06 12:36:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:06,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:06,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:06,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:06,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:36:06,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-02-06 12:36:06,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 179 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-06 12:36:06,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:06,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-02-06 12:36:06,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:06,309 INFO L124 PetriNetUnfolderBase]: 532/1132 cut-off events. [2025-02-06 12:36:06,309 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-02-06 12:36:06,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1132 events. 532/1132 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6106 event pairs, 468 based on Foata normal form. 2/1118 useless extension candidates. Maximal degree in co-relation 2071. Up to 864 conditions per place. [2025-02-06 12:36:06,316 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2025-02-06 12:36:06,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 53 transitions, 261 flow [2025-02-06 12:36:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:36:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:36:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2025-02-06 12:36:06,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-02-06 12:36:06,317 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 179 flow. Second operand 8 states and 189 transitions. [2025-02-06 12:36:06,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 53 transitions, 261 flow [2025-02-06 12:36:06,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 235 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-06 12:36:06,319 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 175 flow [2025-02-06 12:36:06,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-02-06 12:36:06,320 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-02-06 12:36:06,320 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 175 flow [2025-02-06 12:36:06,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-06 12:36:06,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:06,320 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:06,329 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-06 12:36:06,522 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-06 12:36:06,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-02-06 12:36:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash -496942738, now seen corresponding path program 2 times [2025-02-06 12:36:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:06,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976642281] [2025-02-06 12:36:06,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:06,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 12:36:06,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-02-06 12:36:06,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:36:06,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:06,628 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-06 12:36:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976642281] [2025-02-06 12:36:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976642281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:06,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338557582] [2025-02-06 12:36:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:06,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:06,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:06,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-02-06 12:36:06,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-06 12:36:06,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:06,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-02-06 12:36:06,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:06,900 INFO L124 PetriNetUnfolderBase]: 1009/2081 cut-off events. [2025-02-06 12:36:06,900 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 12:36:06,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 2081 events. 1009/2081 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 12214 event pairs, 168 based on Foata normal form. 33/2077 useless extension candidates. Maximal degree in co-relation 3827. Up to 688 conditions per place. [2025-02-06 12:36:06,908 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 65 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-02-06 12:36:06,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 393 flow [2025-02-06 12:36:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-02-06 12:36:06,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 12:36:06,909 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 175 flow. Second operand 5 states and 160 transitions. [2025-02-06 12:36:06,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 393 flow [2025-02-06 12:36:06,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 379 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-02-06 12:36:06,911 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 188 flow [2025-02-06 12:36:06,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-02-06 12:36:06,911 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-02-06 12:36:06,912 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 188 flow [2025-02-06 12:36:06,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-06 12:36:06,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:06,912 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 12:36:06,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:36:06,912 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-06 12:36:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1194604928, now seen corresponding path program 1 times [2025-02-06 12:36:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416755737] [2025-02-06 12:36:06,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:06,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:36:06,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:36:06,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:06,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:06,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:06,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:36:06,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:36:06,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:06,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:06,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:06,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-02-06 12:36:06,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-02-06 12:36:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-02-06 12:36:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-02-06 12:36:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-02-06 12:36:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-02-06 12:36:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-02-06 12:36:06,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:36:06,952 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-02-06 12:36:06,952 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:06,952 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:36:06,970 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:06,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 78 transitions, 174 flow [2025-02-06 12:36:06,975 INFO L124 PetriNetUnfolderBase]: 10/92 cut-off events. [2025-02-06 12:36:06,975 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:36:06,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 10/92 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 251 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2025-02-06 12:36:06,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 78 transitions, 174 flow [2025-02-06 12:36:06,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 174 flow [2025-02-06 12:36:06,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:06,977 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;@634bcc23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:06,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 12:36:06,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:06,978 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 12:36:06,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:06,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:06,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:06,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:06,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash 368584, now seen corresponding path program 1 times [2025-02-06 12:36:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105082560] [2025-02-06 12:36:06,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:06,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:06,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:06,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:06,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:06,999 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-06 12:36:07,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105082560] [2025-02-06 12:36:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105082560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:07,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:07,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:07,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824001547] [2025-02-06 12:36:07,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:07,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:07,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:07,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:07,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 78 [2025-02-06 12:36:07,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-06 12:36:07,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:07,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 78 [2025-02-06 12:36:07,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:07,983 INFO L124 PetriNetUnfolderBase]: 8632/14642 cut-off events. [2025-02-06 12:36:07,983 INFO L125 PetriNetUnfolderBase]: For 684/684 co-relation queries the response was YES. [2025-02-06 12:36:08,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27045 conditions, 14642 events. 8632/14642 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 106974 event pairs, 7668 based on Foata normal form. 1878/16290 useless extension candidates. Maximal degree in co-relation 8570. Up to 11966 conditions per place. [2025-02-06 12:36:08,078 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 38 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-02-06 12:36:08,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 220 flow [2025-02-06 12:36:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-02-06 12:36:08,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-02-06 12:36:08,080 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 174 flow. Second operand 3 states and 122 transitions. [2025-02-06 12:36:08,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 220 flow [2025-02-06 12:36:08,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 218 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:08,082 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 142 flow [2025-02-06 12:36:08,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-02-06 12:36:08,083 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2025-02-06 12:36:08,083 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 142 flow [2025-02-06 12:36:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-06 12:36:08,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:08,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:08,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:36:08,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 368585, now seen corresponding path program 1 times [2025-02-06 12:36:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123310334] [2025-02-06 12:36:08,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:08,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:08,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:08,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:08,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:08,124 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-06 12:36:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123310334] [2025-02-06 12:36:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123310334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:08,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137677280] [2025-02-06 12:36:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:08,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:08,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:08,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-02-06 12:36:08,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:08,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:08,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-02-06 12:36:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:09,049 INFO L124 PetriNetUnfolderBase]: 8632/14644 cut-off events. [2025-02-06 12:36:09,049 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-02-06 12:36:09,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26952 conditions, 14644 events. 8632/14644 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 107017 event pairs, 7668 based on Foata normal form. 0/14413 useless extension candidates. Maximal degree in co-relation 26943. Up to 11968 conditions per place. [2025-02-06 12:36:09,123 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 40 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-02-06 12:36:09,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 230 flow [2025-02-06 12:36:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-02-06 12:36:09,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2025-02-06 12:36:09,125 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 142 flow. Second operand 3 states and 125 transitions. [2025-02-06 12:36:09,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 230 flow [2025-02-06 12:36:09,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:09,128 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 155 flow [2025-02-06 12:36:09,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-02-06 12:36:09,129 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2025-02-06 12:36:09,129 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 155 flow [2025-02-06 12:36:09,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:09,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:09,129 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 12:36:09,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:36:09,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 354222239, now seen corresponding path program 1 times [2025-02-06 12:36:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:09,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444630435] [2025-02-06 12:36:09,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:09,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:36:09,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:36:09,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:09,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:09,184 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-06 12:36:09,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444630435] [2025-02-06 12:36:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444630435] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363389586] [2025-02-06 12:36:09,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:09,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:09,186 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-06 12:36:09,188 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-06 12:36:09,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:36:09,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:36:09,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:09,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:09,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:36:09,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:09,282 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-06 12:36:09,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:09,310 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-06 12:36:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363389586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:09,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-02-06 12:36:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888664420] [2025-02-06 12:36:09,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:09,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:09,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:09,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:36:09,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-02-06 12:36:09,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 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-06 12:36:09,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:09,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-02-06 12:36:09,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:10,188 INFO L124 PetriNetUnfolderBase]: 8634/14652 cut-off events. [2025-02-06 12:36:10,189 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-02-06 12:36:10,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26980 conditions, 14652 events. 8634/14652 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 106938 event pairs, 7668 based on Foata normal form. 1/14423 useless extension candidates. Maximal degree in co-relation 26969. Up to 11970 conditions per place. [2025-02-06 12:36:10,279 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 43 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-02-06 12:36:10,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 283 flow [2025-02-06 12:36:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:36:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:36:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-02-06 12:36:10,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-02-06 12:36:10,281 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 155 flow. Second operand 6 states and 216 transitions. [2025-02-06 12:36:10,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 283 flow [2025-02-06 12:36:10,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:10,283 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 205 flow [2025-02-06 12:36:10,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-02-06 12:36:10,284 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-02-06 12:36:10,284 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 205 flow [2025-02-06 12:36:10,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 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-06 12:36:10,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:10,284 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-06 12:36:10,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:36:10,488 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-06 12:36:10,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:10,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2123592225, now seen corresponding path program 2 times [2025-02-06 12:36:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166661987] [2025-02-06 12:36:10,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:10,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 12:36:10,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:10,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:10,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:10,649 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-06 12:36:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166661987] [2025-02-06 12:36:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166661987] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323192190] [2025-02-06 12:36:10,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:10,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:10,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:10,652 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-06 12:36:10,654 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-06 12:36:10,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 12:36:10,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:10,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:10,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 12:36:10,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:10,848 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-06 12:36:10,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:10,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323192190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:10,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:36:10,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-02-06 12:36:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197334794] [2025-02-06 12:36:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:10,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:10,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:10,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:36:10,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-02-06 12:36:10,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 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-06 12:36:10,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:10,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-02-06 12:36:10,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:11,840 INFO L124 PetriNetUnfolderBase]: 8634/14651 cut-off events. [2025-02-06 12:36:11,840 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2025-02-06 12:36:11,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26993 conditions, 14651 events. 8634/14651 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 107062 event pairs, 7668 based on Foata normal form. 1/14423 useless extension candidates. Maximal degree in co-relation 26978. Up to 11966 conditions per place. [2025-02-06 12:36:11,908 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 39 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-02-06 12:36:11,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 301 flow [2025-02-06 12:36:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:36:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:36:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2025-02-06 12:36:11,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42628205128205127 [2025-02-06 12:36:11,909 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 205 flow. Second operand 8 states and 266 transitions. [2025-02-06 12:36:11,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 301 flow [2025-02-06 12:36:11,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 275 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 12:36:11,911 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 197 flow [2025-02-06 12:36:11,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2025-02-06 12:36:11,912 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-02-06 12:36:11,912 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 197 flow [2025-02-06 12:36:11,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 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-06 12:36:11,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:11,912 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:11,921 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-06 12:36:12,117 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-06 12:36:12,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2138623121, now seen corresponding path program 1 times [2025-02-06 12:36:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:12,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105632198] [2025-02-06 12:36:12,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:12,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:36:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:12,162 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-06 12:36:12,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105632198] [2025-02-06 12:36:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105632198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:36:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046674604] [2025-02-06 12:36:12,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:12,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:12,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:12,164 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-06 12:36:12,166 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-06 12:36:12,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:36:12,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:36:12,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:12,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:12,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:36:12,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:12,234 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-06 12:36:12,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:12,252 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-06 12:36:12,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046674604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:12,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:36:12,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 12:36:12,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041581512] [2025-02-06 12:36:12,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:12,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:36:12,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:12,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:36:12,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:36:12,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 78 [2025-02-06 12:36:12,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 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-06 12:36:12,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:12,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 78 [2025-02-06 12:36:12,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:13,068 INFO L124 PetriNetUnfolderBase]: 8632/14652 cut-off events. [2025-02-06 12:36:13,068 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-02-06 12:36:13,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26997 conditions, 14652 events. 8632/14652 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 107044 event pairs, 7668 based on Foata normal form. 4/14427 useless extension candidates. Maximal degree in co-relation 26984. Up to 11965 conditions per place. [2025-02-06 12:36:13,141 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 42 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2025-02-06 12:36:13,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 72 transitions, 314 flow [2025-02-06 12:36:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:36:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:36:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 278 transitions. [2025-02-06 12:36:13,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44551282051282054 [2025-02-06 12:36:13,144 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 197 flow. Second operand 8 states and 278 transitions. [2025-02-06 12:36:13,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 72 transitions, 314 flow [2025-02-06 12:36:13,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 296 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-06 12:36:13,145 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 209 flow [2025-02-06 12:36:13,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-02-06 12:36:13,146 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-02-06 12:36:13,146 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 209 flow [2025-02-06 12:36:13,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 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-06 12:36:13,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:13,147 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:13,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:36:13,347 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-06 12:36:13,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1017720263, now seen corresponding path program 2 times [2025-02-06 12:36:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138665908] [2025-02-06 12:36:13,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:13,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 12:36:13,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-02-06 12:36:13,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:36:13,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:13,433 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-06 12:36:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138665908] [2025-02-06 12:36:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138665908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77836540] [2025-02-06 12:36:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:13,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:13,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:13,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:13,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-02-06 12:36:13,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 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-06 12:36:13,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:13,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-02-06 12:36:13,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:15,029 INFO L124 PetriNetUnfolderBase]: 16399/27293 cut-off events. [2025-02-06 12:36:15,029 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-02-06 12:36:15,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50707 conditions, 27293 events. 16399/27293 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 208053 event pairs, 5643 based on Foata normal form. 333/27049 useless extension candidates. Maximal degree in co-relation 50692. Up to 9568 conditions per place. [2025-02-06 12:36:15,189 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 98 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-02-06 12:36:15,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 547 flow [2025-02-06 12:36:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-02-06 12:36:15,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974358974358974 [2025-02-06 12:36:15,191 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 209 flow. Second operand 5 states and 233 transitions. [2025-02-06 12:36:15,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 547 flow [2025-02-06 12:36:15,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 539 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:36:15,193 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 228 flow [2025-02-06 12:36:15,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-02-06 12:36:15,194 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-02-06 12:36:15,194 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 228 flow [2025-02-06 12:36:15,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 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-06 12:36:15,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:15,194 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:15,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:36:15,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:15,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash -794778769, now seen corresponding path program 1 times [2025-02-06 12:36:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:15,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070741995] [2025-02-06 12:36:15,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:15,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:36:15,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:36:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:15,347 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-06 12:36:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070741995] [2025-02-06 12:36:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070741995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:15,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:15,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125289895] [2025-02-06 12:36:15,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:15,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:15,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:15,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:15,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-02-06 12:36:15,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-06 12:36:15,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:15,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-02-06 12:36:15,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:18,455 INFO L124 PetriNetUnfolderBase]: 29468/48959 cut-off events. [2025-02-06 12:36:18,455 INFO L125 PetriNetUnfolderBase]: For 8329/8812 co-relation queries the response was YES. [2025-02-06 12:36:18,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96680 conditions, 48959 events. 29468/48959 cut-off events. For 8329/8812 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 397901 event pairs, 7462 based on Foata normal form. 594/48647 useless extension candidates. Maximal degree in co-relation 96662. Up to 17136 conditions per place. [2025-02-06 12:36:18,724 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 102 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-02-06 12:36:18,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 604 flow [2025-02-06 12:36:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-02-06 12:36:18,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2025-02-06 12:36:18,726 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 228 flow. Second operand 5 states and 231 transitions. [2025-02-06 12:36:18,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 604 flow [2025-02-06 12:36:18,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:18,732 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 254 flow [2025-02-06 12:36:18,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2025-02-06 12:36:18,733 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-02-06 12:36:18,733 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 254 flow [2025-02-06 12:36:18,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-06 12:36:18,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:18,733 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:18,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:36:18,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-02-06 12:36:18,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1245869759, now seen corresponding path program 1 times [2025-02-06 12:36:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:18,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202463935] [2025-02-06 12:36:18,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:18,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:36:18,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:36:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:18,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:36:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:36:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:18,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:18,756 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:18,756 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-06 12:36:18,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-06 12:36:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-02-06 12:36:18,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:36:18,758 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-02-06 12:36:18,758 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:18,758 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:36:18,777 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:18,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 228 flow [2025-02-06 12:36:18,784 INFO L124 PetriNetUnfolderBase]: 13/119 cut-off events. [2025-02-06 12:36:18,784 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:36:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 119 events. 13/119 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 384 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 100. Up to 5 conditions per place. [2025-02-06 12:36:18,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 100 transitions, 228 flow [2025-02-06 12:36:18,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 228 flow [2025-02-06 12:36:18,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:18,786 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;@634bcc23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:18,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-06 12:36:18,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:18,787 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 12:36:18,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:18,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:18,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:18,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-02-06 12:36:18,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash 467884, now seen corresponding path program 1 times [2025-02-06 12:36:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:18,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953515882] [2025-02-06 12:36:18,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:18,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:18,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:18,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:18,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:18,807 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-06 12:36:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953515882] [2025-02-06 12:36:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953515882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:18,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638838799] [2025-02-06 12:36:18,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:18,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:18,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:18,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 100 [2025-02-06 12:36:18,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 100 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-06 12:36:18,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:18,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 100 [2025-02-06 12:36:18,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:28,525 INFO L124 PetriNetUnfolderBase]: 119632/179858 cut-off events. [2025-02-06 12:36:28,526 INFO L125 PetriNetUnfolderBase]: For 11956/11956 co-relation queries the response was YES. [2025-02-06 12:36:28,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338262 conditions, 179858 events. 119632/179858 cut-off events. For 11956/11956 co-relation queries the response was YES. Maximal size of possible extension queue 4931. Compared 1519620 event pairs, 106668 based on Foata normal form. 25424/202901 useless extension candidates. Maximal degree in co-relation 27148. Up to 152966 conditions per place. [2025-02-06 12:36:29,444 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 49 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2025-02-06 12:36:29,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 288 flow [2025-02-06 12:36:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-02-06 12:36:29,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-02-06 12:36:29,445 INFO L175 Difference]: Start difference. First operand has 96 places, 100 transitions, 228 flow. Second operand 3 states and 157 transitions. [2025-02-06 12:36:29,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 288 flow [2025-02-06 12:36:29,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:29,450 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 184 flow [2025-02-06 12:36:29,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2025-02-06 12:36:29,451 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -10 predicate places. [2025-02-06 12:36:29,451 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 184 flow [2025-02-06 12:36:29,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-06 12:36:29,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:29,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:36:29,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-02-06 12:36:29,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash 467885, now seen corresponding path program 1 times [2025-02-06 12:36:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:29,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340110888] [2025-02-06 12:36:29,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:29,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:29,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:29,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:29,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:29,477 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-06 12:36:29,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:29,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340110888] [2025-02-06 12:36:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340110888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:29,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81705456] [2025-02-06 12:36:29,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:29,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:29,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:29,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:29,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 100 [2025-02-06 12:36:29,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:29,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:29,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 100 [2025-02-06 12:36:29,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand