./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 14:00:55,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:00:55,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:00:55,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:00:55,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:00:55,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:00:55,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:00:55,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:00:55,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:00:55,071 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:00:55,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:00:55,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:00:55,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:00:55,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:00:55,072 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:00:55,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:00:55,072 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:00:55,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:00:55,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:00:55,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:00:55,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:00:55,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:00:55,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:00:55,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:00:55,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:00:55,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:00:55,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:00:55,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:00:55,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:00:55,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:00:55,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:00:55,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:00:55,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:00:55,075 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/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-03-17 14:00:55,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:00:55,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:00:55,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:00:55,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:00:55,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:00:55,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-17 14:00:56,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c74c5388/836c6871ba1a491298c41e96e57803e1/FLAGffb7dbb11 [2025-03-17 14:00:56,733 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:00:56,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-17 14:00:56,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c74c5388/836c6871ba1a491298c41e96e57803e1/FLAGffb7dbb11 [2025-03-17 14:00:57,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c74c5388/836c6871ba1a491298c41e96e57803e1 [2025-03-17 14:00:57,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:00:57,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:00:57,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:00:57,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:00:57,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:00:57,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364cbd9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57, skipping insertion in model container [2025-03-17 14:00:57,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:00:57,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:00:57,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:00:57,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:00:57,468 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:00:57,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57 WrapperNode [2025-03-17 14:00:57,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:00:57,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:00:57,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:00:57,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:00:57,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,496 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2025-03-17 14:00:57,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:00:57,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:00:57,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:00:57,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:00:57,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,513 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-03-17 14:00:57,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:00:57,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:00:57,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:00:57,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:00:57,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (1/1) ... [2025-03-17 14:00:57,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:00:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:00:57,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:00:57,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:00:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 14:00:57,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:00:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:00:57,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:00:57,575 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:00:57,674 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:00:57,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:00:57,844 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:00:57,844 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:00:57,955 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:00:57,955 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:00:57,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:00:57 BoogieIcfgContainer [2025-03-17 14:00:57,956 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:00:57,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:00:57,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:00:57,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:00:57,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:00:57" (1/3) ... [2025-03-17 14:00:57,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2259f28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:00:57, skipping insertion in model container [2025-03-17 14:00:57,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:57" (2/3) ... [2025-03-17 14:00:57,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2259f28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:00:57, skipping insertion in model container [2025-03-17 14:00:57,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:00:57" (3/3) ... [2025-03-17 14:00:57,964 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-17 14:00:57,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:00:57,977 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-03-17 14:00:57,977 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:00:58,018 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:00:58,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 72 flow [2025-03-17 14:00:58,066 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-17 14:00:58,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:58,070 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 54 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-03-17 14:00:58,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 72 flow [2025-03-17 14:00:58,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 34 transitions, 72 flow [2025-03-17 14:00:58,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:00:58,090 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;@7aad24ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:00:58,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:00:58,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:00:58,095 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:00:58,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:58,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:58,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:00:58,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:00:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash 235553, now seen corresponding path program 1 times [2025-03-17 14:00:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963535850] [2025-03-17 14:00:58,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:58,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:00:58,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:00:58,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:58,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:58,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963535850] [2025-03-17 14:00:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963535850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:58,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:00:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77022281] [2025-03-17 14:00:58,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:58,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:00:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:58,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:00:58,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:00:58,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-17 14:00:58,332 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-03-17 14:00:58,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:58,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-17 14:00:58,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:58,380 INFO L124 PetriNetUnfolderBase]: 22/79 cut-off events. [2025-03-17 14:00:58,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:58,380 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-03-17 14:00:58,382 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 16 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-03-17 14:00:58,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 90 flow [2025-03-17 14:00:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:00:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:00:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-17 14:00:58,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2025-03-17 14:00:58,392 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 72 flow. Second operand 3 states and 52 transitions. [2025-03-17 14:00:58,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 90 flow [2025-03-17 14:00:58,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:00:58,397 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 58 flow [2025-03-17 14:00:58,399 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-03-17 14:00:58,401 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2025-03-17 14:00:58,402 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 58 flow [2025-03-17 14:00:58,402 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-03-17 14:00:58,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:58,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:00:58,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:00:58,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:00:58,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash 235554, now seen corresponding path program 1 times [2025-03-17 14:00:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488434281] [2025-03-17 14:00:58,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:58,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:00:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:00:58,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:58,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:58,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:58,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488434281] [2025-03-17 14:00:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488434281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:58,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:00:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443875989] [2025-03-17 14:00:58,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:58,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:00:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:58,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:00:58,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:00:58,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-17 14:00:58,549 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-03-17 14:00:58,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:58,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-17 14:00:58,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:58,606 INFO L124 PetriNetUnfolderBase]: 22/81 cut-off events. [2025-03-17 14:00:58,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:58,606 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-03-17 14:00:58,607 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 18 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-03-17 14:00:58,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 102 flow [2025-03-17 14:00:58,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:00:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:00:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-17 14:00:58,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-03-17 14:00:58,612 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 58 flow. Second operand 3 states and 55 transitions. [2025-03-17 14:00:58,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 102 flow [2025-03-17 14:00:58,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 101 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:00:58,615 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 71 flow [2025-03-17 14:00:58,615 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-03-17 14:00:58,616 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-03-17 14:00:58,616 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 71 flow [2025-03-17 14:00:58,617 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-03-17 14:00:58,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:58,617 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:00:58,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:00:58,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:00:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 226375191, now seen corresponding path program 1 times [2025-03-17 14:00:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047542683] [2025-03-17 14:00:58,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:58,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:00:58,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:00:58,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:58,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047542683] [2025-03-17 14:00:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047542683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:00:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265228270] [2025-03-17 14:00:58,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:58,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:00:58,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:00:58,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:00:58,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:00:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:00:58,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:00:58,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:58,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:58,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:00:58,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:00:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:58,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:00:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265228270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:00:58,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:00:58,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:00:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967194113] [2025-03-17 14:00:58,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:00:58,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:00:58,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:58,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:00:58,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:00:58,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-17 14:00:58,980 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-03-17 14:00:58,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:58,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-17 14:00:58,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:59,097 INFO L124 PetriNetUnfolderBase]: 24/89 cut-off events. [2025-03-17 14:00:59,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:59,098 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 197 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-03-17 14:00:59,098 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 21 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-03-17 14:00:59,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 155 flow [2025-03-17 14:00:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:00:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:00:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-17 14:00:59,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-17 14:00:59,099 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 71 flow. Second operand 6 states and 98 transitions. [2025-03-17 14:00:59,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 155 flow [2025-03-17 14:00:59,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:00:59,101 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2025-03-17 14:00:59,101 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-03-17 14:00:59,101 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-03-17 14:00:59,101 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2025-03-17 14:00:59,101 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-03-17 14:00:59,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:59,101 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-17 14:00:59,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:00:59,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:00:59,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:00:59,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1976653942, now seen corresponding path program 2 times [2025-03-17 14:00:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109171922] [2025-03-17 14:00:59,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:00:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:59,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:00:59,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:00:59,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:00:59,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:59,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109171922] [2025-03-17 14:00:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109171922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:00:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793719597] [2025-03-17 14:00:59,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:00:59,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:00:59,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:00:59,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:00:59,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:00:59,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:00:59,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:00:59,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:00:59,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:59,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:00:59,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:00:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:59,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:00:59,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793719597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:59,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:00:59,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-17 14:00:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333212542] [2025-03-17 14:00:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:59,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:00:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:59,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:00:59,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:00:59,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-17 14:00:59,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 121 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-03-17 14:00:59,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:59,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-17 14:00:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:59,873 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-03-17 14:00:59,873 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 14:00:59,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 88 events. 24/88 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 196 event pairs, 18 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 175. Up to 56 conditions per place. [2025-03-17 14:00:59,874 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 17 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2025-03-17 14:00:59,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 173 flow [2025-03-17 14:00:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:00:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:00:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-03-17 14:00:59,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2025-03-17 14:00:59,875 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 8 states and 116 transitions. [2025-03-17 14:00:59,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 173 flow [2025-03-17 14:00:59,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 147 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-17 14:00:59,877 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 113 flow [2025-03-17 14:00:59,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=113, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-17 14:00:59,878 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-17 14:00:59,878 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 113 flow [2025-03-17 14:00:59,878 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-03-17 14:00:59,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:59,878 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:00:59,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:00,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 14:01:00,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:00,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2008073601, now seen corresponding path program 1 times [2025-03-17 14:01:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169832452] [2025-03-17 14:01:00,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:00,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:00,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:00,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:00,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169832452] [2025-03-17 14:01:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169832452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102999312] [2025-03-17 14:01:00,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:00,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:00,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:00,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:00,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:01:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:00,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:00,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:00,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:00,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:01:00,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:00,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102999312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:00,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:01:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606026676] [2025-03-17 14:01:00,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:00,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:01:00,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:01:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:01:00,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-17 14:01:00,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 113 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-03-17 14:01:00,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:00,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-17 14:01:00,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:00,299 INFO L124 PetriNetUnfolderBase]: 22/89 cut-off events. [2025-03-17 14:01:00,299 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:01:00,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 89 events. 22/89 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 18 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 181. Up to 55 conditions per place. [2025-03-17 14:01:00,303 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 20 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2025-03-17 14:01:00,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 186 flow [2025-03-17 14:01:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-03-17 14:01:00,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-03-17 14:01:00,304 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 113 flow. Second operand 8 states and 128 transitions. [2025-03-17 14:01:00,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 186 flow [2025-03-17 14:01:00,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 168 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 14:01:00,324 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 125 flow [2025-03-17 14:01:00,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=125, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-03-17 14:01:00,325 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-03-17 14:01:00,325 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 125 flow [2025-03-17 14:01:00,325 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-03-17 14:01:00,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:00,325 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-03-17 14:01:00,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:01:00,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:00,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:00,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -902630955, now seen corresponding path program 2 times [2025-03-17 14:01:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17439295] [2025-03-17 14:01:00,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:00,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:01:00,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:01:00,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:00,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:00,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:00,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:01:00,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:01:00,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:00,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:00,579 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:00,579 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 14:01:00,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-17 14:01:00,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-03-17 14:01:00,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:01:00,584 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-17 14:01:00,585 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:00,586 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 14:01:00,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:00,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 122 flow [2025-03-17 14:01:00,611 INFO L124 PetriNetUnfolderBase]: 7/65 cut-off events. [2025-03-17 14:01:00,611 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:01:00,613 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 140 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-03-17 14:01:00,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 122 flow [2025-03-17 14:01:00,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 122 flow [2025-03-17 14:01:00,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:00,615 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;@7aad24ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:00,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 14:01:00,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:00,616 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:01:00,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:00,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:00,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:00,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash 291161, now seen corresponding path program 1 times [2025-03-17 14:01:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428882465] [2025-03-17 14:01:00,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:00,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:00,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:00,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:00,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428882465] [2025-03-17 14:01:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428882465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:00,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:00,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:00,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542075400] [2025-03-17 14:01:00,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:00,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:00,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:00,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:00,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-03-17 14:01:00,651 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-03-17 14:01:00,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:00,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-03-17 14:01:00,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:00,760 INFO L124 PetriNetUnfolderBase]: 532/1126 cut-off events. [2025-03-17 14:01:00,761 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-17 14:01:00,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 1126 events. 532/1126 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6120 event pairs, 468 based on Foata normal form. 123/1233 useless extension candidates. Maximal degree in co-relation 1291. Up to 866 conditions per place. [2025-03-17 14:01:00,768 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 27 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-03-17 14:01:00,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 154 flow [2025-03-17 14:01:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-17 14:01:00,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-17 14:01:00,770 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 122 flow. Second operand 3 states and 87 transitions. [2025-03-17 14:01:00,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 154 flow [2025-03-17 14:01:00,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:00,771 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 100 flow [2025-03-17 14:01:00,771 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-03-17 14:01:00,771 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-03-17 14:01:00,771 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 100 flow [2025-03-17 14:01:00,771 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-03-17 14:01:00,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:00,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:00,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:01:00,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:00,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash 291162, now seen corresponding path program 1 times [2025-03-17 14:01:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620047645] [2025-03-17 14:01:00,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:00,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:00,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:00,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:00,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620047645] [2025-03-17 14:01:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620047645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506643553] [2025-03-17 14:01:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:00,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:00,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:00,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:00,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-17 14:01:00,834 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-03-17 14:01:00,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:00,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-17 14:01:00,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:00,961 INFO L124 PetriNetUnfolderBase]: 532/1128 cut-off events. [2025-03-17 14:01:00,961 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-17 14:01:00,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 1128 events. 532/1128 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6132 event pairs, 468 based on Foata normal form. 0/1111 useless extension candidates. Maximal degree in co-relation 2027. Up to 868 conditions per place. [2025-03-17 14:01:00,966 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-17 14:01:00,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 166 flow [2025-03-17 14:01:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-17 14:01:00,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-17 14:01:00,967 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 100 flow. Second operand 3 states and 90 transitions. [2025-03-17 14:01:00,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 166 flow [2025-03-17 14:01:00,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:00,968 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 113 flow [2025-03-17 14:01:00,968 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-03-17 14:01:00,968 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-03-17 14:01:00,968 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 113 flow [2025-03-17 14:01:00,968 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-03-17 14:01:00,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:00,968 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:01:00,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:01:00,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:00,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash 279816271, now seen corresponding path program 1 times [2025-03-17 14:01:00,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:00,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687205507] [2025-03-17 14:01:00,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:00,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:00,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:00,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:00,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687205507] [2025-03-17 14:01:01,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687205507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692001592] [2025-03-17 14:01:01,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:01,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:01,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:01,041 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:01,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:01:01,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:01,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:01,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:01,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:01:01,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:01,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692001592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:01,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:01,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:01:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496938454] [2025-03-17 14:01:01,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:01,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:01,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:01,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:01,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:01:01,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-17 14:01:01,211 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-03-17 14:01:01,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:01,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-17 14:01:01,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:01,382 INFO L124 PetriNetUnfolderBase]: 534/1136 cut-off events. [2025-03-17 14:01:01,382 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-17 14:01:01,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 1136 events. 534/1136 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6148 event pairs, 468 based on Foata normal form. 1/1121 useless extension candidates. Maximal degree in co-relation 2053. Up to 870 conditions per place. [2025-03-17 14:01:01,388 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 32 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-03-17 14:01:01,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 219 flow [2025-03-17 14:01:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:01:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:01:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-03-17 14:01:01,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-03-17 14:01:01,390 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 113 flow. Second operand 6 states and 157 transitions. [2025-03-17 14:01:01,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 219 flow [2025-03-17 14:01:01,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:01,392 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 163 flow [2025-03-17 14:01:01,392 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-03-17 14:01:01,394 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-03-17 14:01:01,394 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 163 flow [2025-03-17 14:01:01,395 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-03-17 14:01:01,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:01,395 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-17 14:01:01,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:01:01,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:01,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:01,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1791027794, now seen corresponding path program 2 times [2025-03-17 14:01:01,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:01,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881124032] [2025-03-17 14:01:01,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:01,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:01,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:01,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:01,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:01,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:01,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881124032] [2025-03-17 14:01:01,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881124032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:01,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115350451] [2025-03-17 14:01:01,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:01,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:01,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:01,768 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:01,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:01:01,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:01,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:01,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:01,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:01,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:01:01,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:01,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:01:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115350451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:01,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:01:01,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-17 14:01:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935939220] [2025-03-17 14:01:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:01,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:01,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:01,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:01:01,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-17 14:01:01,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 163 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-03-17 14:01:01,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:01,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-17 14:01:01,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:02,124 INFO L124 PetriNetUnfolderBase]: 534/1135 cut-off events. [2025-03-17 14:01:02,124 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 14:01:02,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 1135 events. 534/1135 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6133 event pairs, 468 based on Foata normal form. 1/1121 useless extension candidates. Maximal degree in co-relation 2062. Up to 866 conditions per place. [2025-03-17 14:01:02,131 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2025-03-17 14:01:02,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 237 flow [2025-03-17 14:01:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-03-17 14:01:02,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4263392857142857 [2025-03-17 14:01:02,133 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 163 flow. Second operand 8 states and 191 transitions. [2025-03-17 14:01:02,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 237 flow [2025-03-17 14:01:02,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 211 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-17 14:01:02,134 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 155 flow [2025-03-17 14:01:02,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=155, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-03-17 14:01:02,134 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2025-03-17 14:01:02,134 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 155 flow [2025-03-17 14:01:02,135 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-03-17 14:01:02,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:02,135 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:02,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:02,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:01:02,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:02,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:02,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1758931277, now seen corresponding path program 1 times [2025-03-17 14:01:02,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908994527] [2025-03-17 14:01:02,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:02,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:02,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:02,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:02,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908994527] [2025-03-17 14:01:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908994527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306434133] [2025-03-17 14:01:02,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:02,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:02,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:02,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:01:02,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:02,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:02,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:02,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:02,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:01:02,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:02,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306434133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:02,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:01:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960064312] [2025-03-17 14:01:02,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:02,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:01:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:02,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:01:02,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:01:02,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-03-17 14:01:02,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 155 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-03-17 14:01:02,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:02,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-03-17 14:01:02,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:02,622 INFO L124 PetriNetUnfolderBase]: 532/1136 cut-off events. [2025-03-17 14:01:02,623 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 14:01:02,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 1136 events. 532/1136 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6111 event pairs, 468 based on Foata normal form. 4/1125 useless extension candidates. Maximal degree in co-relation 2068. Up to 865 conditions per place. [2025-03-17 14:01:02,627 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-03-17 14:01:02,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 250 flow [2025-03-17 14:01:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-03-17 14:01:02,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-03-17 14:01:02,629 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 155 flow. Second operand 8 states and 203 transitions. [2025-03-17 14:01:02,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 250 flow [2025-03-17 14:01:02,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 232 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 14:01:02,630 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 167 flow [2025-03-17 14:01:02,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=167, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2025-03-17 14:01:02,630 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-17 14:01:02,631 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 167 flow [2025-03-17 14:01:02,631 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-03-17 14:01:02,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:02,631 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:02,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:02,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:02,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:02,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash -806099193, now seen corresponding path program 2 times [2025-03-17 14:01:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569106470] [2025-03-17 14:01:02,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:02,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:02,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:01:02,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-17 14:01:02,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:01:02,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 14:01:02,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569106470] [2025-03-17 14:01:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569106470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373624747] [2025-03-17 14:01:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:02,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:02,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:02,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:02,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:02,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-17 14:01:02,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 167 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-03-17 14:01:02,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:02,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-17 14:01:02,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:03,177 INFO L124 PetriNetUnfolderBase]: 1009/2083 cut-off events. [2025-03-17 14:01:03,177 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 14:01:03,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3836 conditions, 2083 events. 1009/2083 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 12217 event pairs, 168 based on Foata normal form. 33/2080 useless extension candidates. Maximal degree in co-relation 3822. Up to 688 conditions per place. [2025-03-17 14:01:03,184 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 65 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-03-17 14:01:03,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 385 flow [2025-03-17 14:01:03,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-17 14:01:03,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-17 14:01:03,185 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 167 flow. Second operand 5 states and 160 transitions. [2025-03-17 14:01:03,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 385 flow [2025-03-17 14:01:03,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:01:03,187 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 186 flow [2025-03-17 14:01:03,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=159, 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=186, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-03-17 14:01:03,187 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-03-17 14:01:03,188 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 186 flow [2025-03-17 14:01:03,188 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-03-17 14:01:03,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:03,188 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 14:01:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:01:03,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:03,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1430294087, now seen corresponding path program 1 times [2025-03-17 14:01:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661151203] [2025-03-17 14:01:03,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:03,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:03,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:03,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:03,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:03,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:03,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:03,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:03,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:03,219 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:03,219 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 14:01:03,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-03-17 14:01:03,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-03-17 14:01:03,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:01:03,220 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-17 14:01:03,220 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:03,220 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 14:01:03,239 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:03,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 78 transitions, 174 flow [2025-03-17 14:01:03,245 INFO L124 PetriNetUnfolderBase]: 10/92 cut-off events. [2025-03-17 14:01:03,245 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:01:03,245 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 254 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-03-17 14:01:03,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 78 transitions, 174 flow [2025-03-17 14:01:03,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 174 flow [2025-03-17 14:01:03,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:03,247 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;@7aad24ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:03,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 14:01:03,248 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:03,248 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:01:03,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:03,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:03,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:03,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash 368615, now seen corresponding path program 1 times [2025-03-17 14:01:03,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:03,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096925404] [2025-03-17 14:01:03,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:03,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:03,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:03,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:03,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:03,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:03,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096925404] [2025-03-17 14:01:03,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096925404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264151224] [2025-03-17 14:01:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:03,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:03,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:03,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:03,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 78 [2025-03-17 14:01:03,279 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-03-17 14:01:03,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:03,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 78 [2025-03-17 14:01:03,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:04,126 INFO L124 PetriNetUnfolderBase]: 8632/14646 cut-off events. [2025-03-17 14:01:04,126 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2025-03-17 14:01:04,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27049 conditions, 14646 events. 8632/14646 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106901 event pairs, 7668 based on Foata normal form. 1878/16295 useless extension candidates. Maximal degree in co-relation 8570. Up to 11966 conditions per place. [2025-03-17 14:01:04,192 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 38 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-03-17 14:01:04,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 220 flow [2025-03-17 14:01:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-17 14:01:04,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-03-17 14:01:04,193 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 174 flow. Second operand 3 states and 122 transitions. [2025-03-17 14:01:04,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 220 flow [2025-03-17 14:01:04,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 218 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:04,195 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 142 flow [2025-03-17 14:01:04,195 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-03-17 14:01:04,195 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2025-03-17 14:01:04,195 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 142 flow [2025-03-17 14:01:04,195 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-03-17 14:01:04,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:04,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:04,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:01:04,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:04,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash 368616, now seen corresponding path program 1 times [2025-03-17 14:01:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:04,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995854461] [2025-03-17 14:01:04,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:04,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:04,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:04,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:04,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:04,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995854461] [2025-03-17 14:01:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995854461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:04,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:04,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:04,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327828810] [2025-03-17 14:01:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:04,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:04,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:04,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:04,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-17 14:01:04,262 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-03-17 14:01:04,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:04,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-17 14:01:04,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:05,134 INFO L124 PetriNetUnfolderBase]: 8632/14648 cut-off events. [2025-03-17 14:01:05,134 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-17 14:01:05,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26956 conditions, 14648 events. 8632/14648 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106900 event pairs, 7668 based on Foata normal form. 0/14418 useless extension candidates. Maximal degree in co-relation 26947. Up to 11968 conditions per place. [2025-03-17 14:01:05,190 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 40 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-17 14:01:05,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 230 flow [2025-03-17 14:01:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-03-17 14:01:05,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2025-03-17 14:01:05,192 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 142 flow. Second operand 3 states and 125 transitions. [2025-03-17 14:01:05,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 230 flow [2025-03-17 14:01:05,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:05,193 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 155 flow [2025-03-17 14:01:05,193 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-03-17 14:01:05,193 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2025-03-17 14:01:05,193 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 155 flow [2025-03-17 14:01:05,194 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-03-17 14:01:05,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:05,194 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:01:05,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:01:05,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash 354252061, now seen corresponding path program 1 times [2025-03-17 14:01:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674182159] [2025-03-17 14:01:05,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:05,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:05,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:05,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:05,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:05,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674182159] [2025-03-17 14:01:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674182159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552807672] [2025-03-17 14:01:05,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:05,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:05,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:05,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:05,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:01:05,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:05,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:05,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:05,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:01:05,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:05,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552807672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:05,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:01:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101383052] [2025-03-17 14:01:05,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:05,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:05,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:01:05,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-17 14:01:05,401 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-03-17 14:01:05,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:05,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-17 14:01:05,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:06,142 INFO L124 PetriNetUnfolderBase]: 8634/14656 cut-off events. [2025-03-17 14:01:06,142 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-17 14:01:06,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26984 conditions, 14656 events. 8634/14656 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106977 event pairs, 7668 based on Foata normal form. 1/14428 useless extension candidates. Maximal degree in co-relation 26973. Up to 11970 conditions per place. [2025-03-17 14:01:06,213 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 43 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-03-17 14:01:06,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 283 flow [2025-03-17 14:01:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:01:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:01:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-03-17 14:01:06,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-17 14:01:06,281 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 155 flow. Second operand 6 states and 216 transitions. [2025-03-17 14:01:06,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 283 flow [2025-03-17 14:01:06,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:06,282 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 205 flow [2025-03-17 14:01:06,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-03-17 14:01:06,283 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-17 14:01:06,283 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 205 flow [2025-03-17 14:01:06,283 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-03-17 14:01:06,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:06,283 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-17 14:01:06,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:06,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:06,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:06,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash -596419268, now seen corresponding path program 2 times [2025-03-17 14:01:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:06,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65841721] [2025-03-17 14:01:06,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:06,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:06,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:06,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:06,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:06,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65841721] [2025-03-17 14:01:06,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65841721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993652538] [2025-03-17 14:01:06,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:06,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:06,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:06,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:06,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:01:06,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:06,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:06,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:06,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:01:06,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:06,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:01:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993652538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:01:06,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-17 14:01:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137291094] [2025-03-17 14:01:06,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:06,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:06,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:06,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:01:06,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-17 14:01:06,898 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-03-17 14:01:06,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:06,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-17 14:01:06,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:07,876 INFO L124 PetriNetUnfolderBase]: 8634/14655 cut-off events. [2025-03-17 14:01:07,876 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-03-17 14:01:07,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26997 conditions, 14655 events. 8634/14655 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106915 event pairs, 7668 based on Foata normal form. 1/14428 useless extension candidates. Maximal degree in co-relation 26982. Up to 11966 conditions per place. [2025-03-17 14:01:07,923 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 39 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-17 14:01:07,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 301 flow [2025-03-17 14:01:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2025-03-17 14:01:07,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42628205128205127 [2025-03-17 14:01:07,925 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 205 flow. Second operand 8 states and 266 transitions. [2025-03-17 14:01:07,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 301 flow [2025-03-17 14:01:07,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 275 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-17 14:01:07,927 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 197 flow [2025-03-17 14:01:07,927 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-03-17 14:01:07,927 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-03-17 14:01:07,928 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 197 flow [2025-03-17 14:01:07,928 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-03-17 14:01:07,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:07,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:07,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:01:08,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:01:08,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:08,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:08,129 INFO L85 PathProgramCache]: Analyzing trace with hash -563697140, now seen corresponding path program 1 times [2025-03-17 14:01:08,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:08,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873205521] [2025-03-17 14:01:08,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:08,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:08,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:08,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:08,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873205521] [2025-03-17 14:01:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873205521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199541036] [2025-03-17 14:01:08,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:08,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:08,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:08,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:08,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:01:08,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:08,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:08,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:08,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:08,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:01:08,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:08,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:08,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199541036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:08,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:01:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985143259] [2025-03-17 14:01:08,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:01:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:08,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:01:08,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:01:08,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 78 [2025-03-17 14:01:08,262 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-03-17 14:01:08,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:08,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 78 [2025-03-17 14:01:08,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:08,965 INFO L124 PetriNetUnfolderBase]: 8632/14656 cut-off events. [2025-03-17 14:01:08,965 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-03-17 14:01:08,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27001 conditions, 14656 events. 8632/14656 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106908 event pairs, 7668 based on Foata normal form. 4/14432 useless extension candidates. Maximal degree in co-relation 26988. Up to 11965 conditions per place. [2025-03-17 14:01:09,021 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 42 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2025-03-17 14:01:09,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 72 transitions, 314 flow [2025-03-17 14:01:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 278 transitions. [2025-03-17 14:01:09,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44551282051282054 [2025-03-17 14:01:09,023 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 197 flow. Second operand 8 states and 278 transitions. [2025-03-17 14:01:09,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 72 transitions, 314 flow [2025-03-17 14:01:09,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 296 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 14:01:09,024 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 209 flow [2025-03-17 14:01:09,025 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-03-17 14:01:09,025 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-03-17 14:01:09,025 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 209 flow [2025-03-17 14:01:09,025 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-03-17 14:01:09,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:09,025 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:09,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:09,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:01:09,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:09,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash 708563808, now seen corresponding path program 2 times [2025-03-17 14:01:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464228506] [2025-03-17 14:01:09,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:09,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:01:09,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-17 14:01:09,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:01:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 14:01:09,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464228506] [2025-03-17 14:01:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464228506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:09,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:09,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:09,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946094867] [2025-03-17 14:01:09,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:09,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:09,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:09,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:09,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-17 14:01:09,347 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-03-17 14:01:09,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:09,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-17 14:01:09,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:10,741 INFO L124 PetriNetUnfolderBase]: 16399/27295 cut-off events. [2025-03-17 14:01:10,742 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2025-03-17 14:01:10,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50709 conditions, 27295 events. 16399/27295 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 207543 event pairs, 5643 based on Foata normal form. 333/27052 useless extension candidates. Maximal degree in co-relation 50694. Up to 9568 conditions per place. [2025-03-17 14:01:10,866 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 98 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-03-17 14:01:10,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 547 flow [2025-03-17 14:01:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-03-17 14:01:10,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974358974358974 [2025-03-17 14:01:10,867 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 209 flow. Second operand 5 states and 233 transitions. [2025-03-17 14:01:10,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 547 flow [2025-03-17 14:01:10,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 539 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:01:10,870 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 228 flow [2025-03-17 14:01:10,870 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-03-17 14:01:10,870 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-17 14:01:10,870 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 228 flow [2025-03-17 14:01:10,870 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-03-17 14:01:10,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:10,870 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:10,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:01:10,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1830120246, now seen corresponding path program 1 times [2025-03-17 14:01:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350846914] [2025-03-17 14:01:10,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:10,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:10,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:10,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:10,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 14:01:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:11,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350846914] [2025-03-17 14:01:11,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350846914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:11,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:11,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:11,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603556284] [2025-03-17 14:01:11,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:11,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:11,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:11,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:11,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-17 14:01:11,053 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-03-17 14:01:11,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:11,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-17 14:01:11,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:14,179 INFO L124 PetriNetUnfolderBase]: 29468/48959 cut-off events. [2025-03-17 14:01:14,179 INFO L125 PetriNetUnfolderBase]: For 8329/8812 co-relation queries the response was YES. [2025-03-17 14:01:14,314 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 397486 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-03-17 14:01:14,481 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 102 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-03-17 14:01:14,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 604 flow [2025-03-17 14:01:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-03-17 14:01:14,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2025-03-17 14:01:14,482 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 228 flow. Second operand 5 states and 231 transitions. [2025-03-17 14:01:14,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 604 flow [2025-03-17 14:01:14,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:14,488 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 254 flow [2025-03-17 14:01:14,489 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-03-17 14:01:14,489 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-03-17 14:01:14,489 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 254 flow [2025-03-17 14:01:14,489 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-03-17 14:01:14,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:14,489 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:14,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:01:14,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1348872166, now seen corresponding path program 1 times [2025-03-17 14:01:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480738171] [2025-03-17 14:01:14,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:14,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:01:14,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:01:14,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:14,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:01:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:01:14,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:14,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:14,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:14,517 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:14,517 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-03-17 14:01:14,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-03-17 14:01:14,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:01:14,519 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-17 14:01:14,519 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:14,519 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 14:01:14,540 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:14,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 228 flow [2025-03-17 14:01:14,546 INFO L124 PetriNetUnfolderBase]: 13/119 cut-off events. [2025-03-17 14:01:14,546 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:01:14,546 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 382 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-03-17 14:01:14,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 100 transitions, 228 flow [2025-03-17 14:01:14,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 228 flow [2025-03-17 14:01:14,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:14,548 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;@7aad24ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:14,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-17 14:01:14,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:14,548 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:01:14,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:14,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:14,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:14,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-17 14:01:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 467915, now seen corresponding path program 1 times [2025-03-17 14:01:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004629105] [2025-03-17 14:01:14,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:14,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:14,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:14,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004629105] [2025-03-17 14:01:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004629105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576060377] [2025-03-17 14:01:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:14,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:14,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:14,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:14,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 100 [2025-03-17 14:01:14,577 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-03-17 14:01:14,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:14,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 100 [2025-03-17 14:01:14,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:23,478 INFO L124 PetriNetUnfolderBase]: 119632/179862 cut-off events. [2025-03-17 14:01:23,478 INFO L125 PetriNetUnfolderBase]: For 11960/11960 co-relation queries the response was YES. [2025-03-17 14:01:23,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338266 conditions, 179862 events. 119632/179862 cut-off events. For 11960/11960 co-relation queries the response was YES. Maximal size of possible extension queue 4923. Compared 1519196 event pairs, 106668 based on Foata normal form. 25424/202906 useless extension candidates. Maximal degree in co-relation 27148. Up to 152966 conditions per place. [2025-03-17 14:01:24,492 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 49 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2025-03-17 14:01:24,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 288 flow [2025-03-17 14:01:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-03-17 14:01:24,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-03-17 14:01:24,493 INFO L175 Difference]: Start difference. First operand has 96 places, 100 transitions, 228 flow. Second operand 3 states and 157 transitions. [2025-03-17 14:01:24,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 288 flow [2025-03-17 14:01:24,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:24,498 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 184 flow [2025-03-17 14:01:24,498 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-03-17 14:01:24,498 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -10 predicate places. [2025-03-17 14:01:24,499 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 184 flow [2025-03-17 14:01:24,499 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-03-17 14:01:24,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:24,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:01:24,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-17 14:01:24,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash 467916, now seen corresponding path program 1 times [2025-03-17 14:01:24,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:24,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648597017] [2025-03-17 14:01:24,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:24,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:24,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:24,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:24,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648597017] [2025-03-17 14:01:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648597017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:24,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089597147] [2025-03-17 14:01:24,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:24,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:24,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:24,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:24,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 100 [2025-03-17 14:01:24,550 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-03-17 14:01:24,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:24,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 100 [2025-03-17 14:01:24,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:33,970 INFO L124 PetriNetUnfolderBase]: 119632/179864 cut-off events. [2025-03-17 14:01:33,971 INFO L125 PetriNetUnfolderBase]: For 4712/4712 co-relation queries the response was YES. [2025-03-17 14:01:34,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336173 conditions, 179864 events. 119632/179864 cut-off events. For 4712/4712 co-relation queries the response was YES. Maximal size of possible extension queue 4923. Compared 1518950 event pairs, 106668 based on Foata normal form. 0/177483 useless extension candidates. Maximal degree in co-relation 336163. Up to 152968 conditions per place. [2025-03-17 14:01:34,895 INFO L140 encePairwiseOnDemand]: 96/100 looper letters, 51 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-03-17 14:01:34,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 294 flow [2025-03-17 14:01:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-03-17 14:01:34,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-17 14:01:34,896 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 184 flow. Second operand 3 states and 160 transitions. [2025-03-17 14:01:34,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 294 flow [2025-03-17 14:01:34,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 82 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:34,903 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 197 flow [2025-03-17 14:01:34,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-03-17 14:01:34,903 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -8 predicate places. [2025-03-17 14:01:34,903 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 197 flow [2025-03-17 14:01:34,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-03-17 14:01:34,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:34,904 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:01:34,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:01:34,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-17 14:01:34,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash 449682561, now seen corresponding path program 1 times [2025-03-17 14:01:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139046787] [2025-03-17 14:01:34,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:34,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:34,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:34,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:34,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139046787] [2025-03-17 14:01:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139046787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823433376] [2025-03-17 14:01:34,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:34,945 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:01:34,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:01:34,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:35,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:35,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:35,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:35,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:01:35,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:35,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823433376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:35,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:35,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:01:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750126524] [2025-03-17 14:01:35,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:35,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:35,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:35,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:01:35,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 100 [2025-03-17 14:01:35,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 36.875) internal successors, (295), 8 states have internal predecessors, (295), 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-03-17 14:01:35,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:35,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 100 [2025-03-17 14:01:35,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand