./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:33:32,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:33:32,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:33:32,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:33:32,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:33:32,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:33:32,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:33:32,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:33:32,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:33:32,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:33:32,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:33:32,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:33:32,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:33:32,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:33:32,958 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:33:32,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:33:32,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:33:32,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:33:32,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:33:32,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:33:32,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:33:32,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:33:32,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:33:32,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:33:32,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:33:32,960 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-02-06 12:33:33,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:33:33,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:33:33,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:33:33,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:33:33,185 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:33:33,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-02-06 12:33:34,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fb3b5db4/bde69cff07724d509657bbd99b64d374/FLAGcd68f43cb [2025-02-06 12:33:34,561 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:33:34,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-02-06 12:33:34,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fb3b5db4/bde69cff07724d509657bbd99b64d374/FLAGcd68f43cb [2025-02-06 12:33:34,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fb3b5db4/bde69cff07724d509657bbd99b64d374 [2025-02-06 12:33:34,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:33:34,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:33:34,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:33:34,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:33:34,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:33:34,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:34" (1/1) ... [2025-02-06 12:33:34,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f4b53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:34, skipping insertion in model container [2025-02-06 12:33:34,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:34" (1/1) ... [2025-02-06 12:33:34,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:33:35,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:33:35,261 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:33:35,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:33:35,395 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:33:35,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35 WrapperNode [2025-02-06 12:33:35,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:33:35,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:33:35,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:33:35,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:33:35,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,454 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1040 [2025-02-06 12:33:35,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:33:35,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:33:35,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:33:35,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:33:35,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,497 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 434, 5, 403]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 403, 5, 400]. The 16 writes are split as follows [0, 14, 0, 2]. [2025-02-06 12:33:35,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:33:35,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:33:35,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:33:35,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:33:35,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (1/1) ... [2025-02-06 12:33:35,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:33:35,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:33:35,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:33:35,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:33:35,593 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 12:33:35,594 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 12:33:35,594 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 12:33:35,594 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 12:33:35,594 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:33:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:33:35,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:33:35,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:33:35,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:33:35,597 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:33:35,728 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:33:35,730 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:33:36,802 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:33:36,803 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:33:42,143 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:33:42,143 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:33:42,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:42 BoogieIcfgContainer [2025-02-06 12:33:42,144 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:33:42,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:33:42,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:33:42,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:33:42,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:33:34" (1/3) ... [2025-02-06 12:33:42,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4196e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:42, skipping insertion in model container [2025-02-06 12:33:42,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:35" (2/3) ... [2025-02-06 12:33:42,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4196e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:42, skipping insertion in model container [2025-02-06 12:33:42,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:42" (3/3) ... [2025-02-06 12:33:42,152 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-02-06 12:33:42,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:33:42,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-02-06 12:33:42,166 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:33:42,258 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:33:42,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-02-06 12:33:42,395 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-02-06 12:33:42,397 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:33:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 518 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2025-02-06 12:33:42,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-02-06 12:33:42,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-02-06 12:33:42,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:33:42,424 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;@faa5df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:33:42,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-02-06 12:33:42,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:33:42,450 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 12:33:42,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:33:42,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:42,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:33:42,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:42,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash 74642, now seen corresponding path program 1 times [2025-02-06 12:33:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:42,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91401443] [2025-02-06 12:33:42,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:42,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:33:42,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:33:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:42,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:43,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91401443] [2025-02-06 12:33:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91401443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:43,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:43,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490981829] [2025-02-06 12:33:43,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:43,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:43,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:43,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:43,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-02-06 12:33:43,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:43,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:43,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-02-06 12:33:43,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:43,789 INFO L124 PetriNetUnfolderBase]: 1744/4653 cut-off events. [2025-02-06 12:33:43,790 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 12:33:43,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 4653 events. 1744/4653 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37061 event pairs, 1393 based on Foata normal form. 182/3587 useless extension candidates. Maximal degree in co-relation 7362. Up to 2745 conditions per place. [2025-02-06 12:33:43,824 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-02-06 12:33:43,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 440 flow [2025-02-06 12:33:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-02-06 12:33:43,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7015503875968992 [2025-02-06 12:33:43,839 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 362 transitions. [2025-02-06 12:33:43,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 440 flow [2025-02-06 12:33:43,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 154 transitions, 432 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:43,849 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 316 flow [2025-02-06 12:33:43,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2025-02-06 12:33:43,854 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -11 predicate places. [2025-02-06 12:33:43,855 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 316 flow [2025-02-06 12:33:43,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:43,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:43,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:33:43,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:33:43,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:43,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 74643, now seen corresponding path program 1 times [2025-02-06 12:33:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717101659] [2025-02-06 12:33:43,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:43,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:33:43,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:33:43,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:43,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:44,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717101659] [2025-02-06 12:33:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717101659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:44,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:44,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:44,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418505464] [2025-02-06 12:33:44,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:44,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:44,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:44,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:44,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:44,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-02-06 12:33:44,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:44,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:44,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-02-06 12:33:44,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:44,760 INFO L124 PetriNetUnfolderBase]: 1744/4650 cut-off events. [2025-02-06 12:33:44,764 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 12:33:44,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 4650 events. 1744/4650 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37055 event pairs, 1393 based on Foata normal form. 3/3407 useless extension candidates. Maximal degree in co-relation 7419. Up to 2745 conditions per place. [2025-02-06 12:33:44,818 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-02-06 12:33:44,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 151 transitions, 430 flow [2025-02-06 12:33:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-02-06 12:33:44,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-02-06 12:33:44,832 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 316 flow. Second operand 3 states and 357 transitions. [2025-02-06 12:33:44,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 151 transitions, 430 flow [2025-02-06 12:33:44,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:44,838 INFO L231 Difference]: Finished difference. Result has 148 places, 151 transitions, 310 flow [2025-02-06 12:33:44,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=148, PETRI_TRANSITIONS=151} [2025-02-06 12:33:44,838 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -14 predicate places. [2025-02-06 12:33:44,849 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 151 transitions, 310 flow [2025-02-06 12:33:44,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:44,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:44,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:33:44,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:33:44,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:44,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2069128958, now seen corresponding path program 1 times [2025-02-06 12:33:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88695739] [2025-02-06 12:33:44,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:44,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:33:44,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:33:44,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:44,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:45,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:45,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88695739] [2025-02-06 12:33:45,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88695739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:45,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:45,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748629283] [2025-02-06 12:33:45,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:45,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:33:45,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:45,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:33:45,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:33:46,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-02-06 12:33:46,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 151 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:46,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:46,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-02-06 12:33:46,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:46,541 INFO L124 PetriNetUnfolderBase]: 1744/4648 cut-off events. [2025-02-06 12:33:46,542 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 12:33:46,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4648 events. 1744/4648 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37022 event pairs, 1393 based on Foata normal form. 1/3405 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place. [2025-02-06 12:33:46,561 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 58 selfloop transitions, 3 changer transitions 0/149 dead transitions. [2025-02-06 12:33:46,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 149 transitions, 428 flow [2025-02-06 12:33:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2025-02-06 12:33:46,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6613372093023255 [2025-02-06 12:33:46,563 INFO L175 Difference]: Start difference. First operand has 148 places, 151 transitions, 310 flow. Second operand 4 states and 455 transitions. [2025-02-06 12:33:46,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 149 transitions, 428 flow [2025-02-06 12:33:46,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 149 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:46,566 INFO L231 Difference]: Finished difference. Result has 147 places, 149 transitions, 308 flow [2025-02-06 12:33:46,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2025-02-06 12:33:46,569 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-02-06 12:33:46,569 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 308 flow [2025-02-06 12:33:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:46,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:46,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:33:46,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:33:46,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2069128959, now seen corresponding path program 1 times [2025-02-06 12:33:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:46,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54585298] [2025-02-06 12:33:46,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:46,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:33:46,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:33:46,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:46,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54585298] [2025-02-06 12:33:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54585298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083341895] [2025-02-06 12:33:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:33:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:33:46,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:33:46,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-02-06 12:33:46,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:46,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:46,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-02-06 12:33:46,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:47,186 INFO L124 PetriNetUnfolderBase]: 1744/4646 cut-off events. [2025-02-06 12:33:47,186 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:33:47,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 4646 events. 1744/4646 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36999 event pairs, 1393 based on Foata normal form. 1/3404 useless extension candidates. Maximal degree in co-relation 7412. Up to 2744 conditions per place. [2025-02-06 12:33:47,204 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 60 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2025-02-06 12:33:47,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 430 flow [2025-02-06 12:33:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2025-02-06 12:33:47,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6351744186046512 [2025-02-06 12:33:47,206 INFO L175 Difference]: Start difference. First operand has 147 places, 149 transitions, 308 flow. Second operand 4 states and 437 transitions. [2025-02-06 12:33:47,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 430 flow [2025-02-06 12:33:47,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 424 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:47,208 INFO L231 Difference]: Finished difference. Result has 145 places, 147 transitions, 304 flow [2025-02-06 12:33:47,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=145, PETRI_TRANSITIONS=147} [2025-02-06 12:33:47,209 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -17 predicate places. [2025-02-06 12:33:47,209 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 147 transitions, 304 flow [2025-02-06 12:33:47,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:47,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:47,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:47,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:33:47,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash 584442062, now seen corresponding path program 1 times [2025-02-06 12:33:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733968667] [2025-02-06 12:33:47,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:47,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:33:47,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:33:47,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:47,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733968667] [2025-02-06 12:33:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733968667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:47,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:47,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211706182] [2025-02-06 12:33:47,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:47,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:47,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:47,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:47,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2025-02-06 12:33:47,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 147 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:47,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:47,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2025-02-06 12:33:47,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:48,024 INFO L124 PetriNetUnfolderBase]: 2019/4463 cut-off events. [2025-02-06 12:33:48,027 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 12:33:48,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 4463 events. 2019/4463 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 31647 event pairs, 705 based on Foata normal form. 0/3899 useless extension candidates. Maximal degree in co-relation 7710. Up to 1807 conditions per place. [2025-02-06 12:33:48,046 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 81 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-02-06 12:33:48,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 150 transitions, 485 flow [2025-02-06 12:33:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2025-02-06 12:33:48,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 12:33:48,048 INFO L175 Difference]: Start difference. First operand has 145 places, 147 transitions, 304 flow. Second operand 5 states and 473 transitions. [2025-02-06 12:33:48,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 150 transitions, 485 flow [2025-02-06 12:33:48,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 150 transitions, 479 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:48,050 INFO L231 Difference]: Finished difference. Result has 130 places, 131 transitions, 278 flow [2025-02-06 12:33:48,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=130, PETRI_TRANSITIONS=131} [2025-02-06 12:33:48,054 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -32 predicate places. [2025-02-06 12:33:48,054 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 278 flow [2025-02-06 12:33:48,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:48,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:48,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:48,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:33:48,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:48,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash 584442063, now seen corresponding path program 1 times [2025-02-06 12:33:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:48,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611687183] [2025-02-06 12:33:48,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:48,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:33:48,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:33:48,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:48,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611687183] [2025-02-06 12:33:48,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611687183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:48,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:48,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077634303] [2025-02-06 12:33:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:48,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:33:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:48,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:33:48,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:33:48,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172 [2025-02-06 12:33:48,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:48,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:48,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172 [2025-02-06 12:33:48,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:49,220 INFO L124 PetriNetUnfolderBase]: 1703/3676 cut-off events. [2025-02-06 12:33:49,221 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-02-06 12:33:49,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 3676 events. 1703/3676 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 24515 event pairs, 702 based on Foata normal form. 204/3341 useless extension candidates. Maximal degree in co-relation 2518. Up to 1413 conditions per place. [2025-02-06 12:33:49,232 INFO L140 encePairwiseOnDemand]: 152/172 looper letters, 73 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-02-06 12:33:49,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 136 transitions, 447 flow [2025-02-06 12:33:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2025-02-06 12:33:49,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2025-02-06 12:33:49,234 INFO L175 Difference]: Start difference. First operand has 130 places, 131 transitions, 278 flow. Second operand 5 states and 528 transitions. [2025-02-06 12:33:49,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 136 transitions, 447 flow [2025-02-06 12:33:49,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 136 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:49,237 INFO L231 Difference]: Finished difference. Result has 116 places, 117 transitions, 250 flow [2025-02-06 12:33:49,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=116, PETRI_TRANSITIONS=117} [2025-02-06 12:33:49,237 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-02-06 12:33:49,237 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 117 transitions, 250 flow [2025-02-06 12:33:49,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:49,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:49,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:49,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:33:49,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:49,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:49,239 INFO L85 PathProgramCache]: Analyzing trace with hash 937837040, now seen corresponding path program 1 times [2025-02-06 12:33:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:49,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200884077] [2025-02-06 12:33:49,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:49,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:33:49,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:33:49,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:49,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:49,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200884077] [2025-02-06 12:33:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200884077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:49,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:49,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:33:49,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805381665] [2025-02-06 12:33:49,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:49,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:33:49,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:49,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:33:49,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:33:50,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2025-02-06 12:33:50,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 117 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:50,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2025-02-06 12:33:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:51,049 INFO L124 PetriNetUnfolderBase]: 2502/5392 cut-off events. [2025-02-06 12:33:51,050 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-02-06 12:33:51,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9550 conditions, 5392 events. 2502/5392 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 38773 event pairs, 536 based on Foata normal form. 0/4394 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place. [2025-02-06 12:33:51,069 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 125 selfloop transitions, 11 changer transitions 0/184 dead transitions. [2025-02-06 12:33:51,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 184 transitions, 661 flow [2025-02-06 12:33:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:33:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:33:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2025-02-06 12:33:51,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506644518272426 [2025-02-06 12:33:51,072 INFO L175 Difference]: Start difference. First operand has 116 places, 117 transitions, 250 flow. Second operand 7 states and 663 transitions. [2025-02-06 12:33:51,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 184 transitions, 661 flow [2025-02-06 12:33:51,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 184 transitions, 647 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:51,077 INFO L231 Difference]: Finished difference. Result has 122 places, 127 transitions, 312 flow [2025-02-06 12:33:51,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=122, PETRI_TRANSITIONS=127} [2025-02-06 12:33:51,078 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -40 predicate places. [2025-02-06 12:33:51,078 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 127 transitions, 312 flow [2025-02-06 12:33:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:51,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:51,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:33:51,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 584202995, now seen corresponding path program 1 times [2025-02-06 12:33:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926512571] [2025-02-06 12:33:51,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:51,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:33:51,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:33:51,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:51,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:51,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926512571] [2025-02-06 12:33:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926512571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:51,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:51,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904643663] [2025-02-06 12:33:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:51,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:51,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:51,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:51,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2025-02-06 12:33:51,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 127 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:51,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2025-02-06 12:33:51,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:51,957 INFO L124 PetriNetUnfolderBase]: 2427/5009 cut-off events. [2025-02-06 12:33:51,957 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-02-06 12:33:51,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9367 conditions, 5009 events. 2427/5009 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 34391 event pairs, 906 based on Foata normal form. 87/4642 useless extension candidates. Maximal degree in co-relation 9056. Up to 2023 conditions per place. [2025-02-06 12:33:51,979 INFO L140 encePairwiseOnDemand]: 160/172 looper letters, 109 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-02-06 12:33:51,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 158 transitions, 621 flow [2025-02-06 12:33:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2025-02-06 12:33:51,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6151162790697674 [2025-02-06 12:33:51,982 INFO L175 Difference]: Start difference. First operand has 122 places, 127 transitions, 312 flow. Second operand 5 states and 529 transitions. [2025-02-06 12:33:51,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 158 transitions, 621 flow [2025-02-06 12:33:51,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 158 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:51,985 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 302 flow [2025-02-06 12:33:51,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2025-02-06 12:33:51,985 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -45 predicate places. [2025-02-06 12:33:51,985 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 302 flow [2025-02-06 12:33:51,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:51,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:51,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:33:51,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:51,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:51,987 INFO L85 PathProgramCache]: Analyzing trace with hash 584202996, now seen corresponding path program 1 times [2025-02-06 12:33:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837671718] [2025-02-06 12:33:51,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:51,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:52,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:33:52,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:33:52,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:52,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:52,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837671718] [2025-02-06 12:33:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837671718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:52,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106360249] [2025-02-06 12:33:52,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:52,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:52,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:52,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-02-06 12:33:52,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:52,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-02-06 12:33:52,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:52,468 INFO L124 PetriNetUnfolderBase]: 1382/3055 cut-off events. [2025-02-06 12:33:52,468 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-02-06 12:33:52,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5512 conditions, 3055 events. 1382/3055 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17536 event pairs, 703 based on Foata normal form. 55/2727 useless extension candidates. Maximal degree in co-relation 5504. Up to 1211 conditions per place. [2025-02-06 12:33:52,480 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 81 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2025-02-06 12:33:52,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 132 transitions, 470 flow [2025-02-06 12:33:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2025-02-06 12:33:52,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2025-02-06 12:33:52,481 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 302 flow. Second operand 3 states and 388 transitions. [2025-02-06 12:33:52,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 132 transitions, 470 flow [2025-02-06 12:33:52,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 132 transitions, 439 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-02-06 12:33:52,486 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 235 flow [2025-02-06 12:33:52,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2025-02-06 12:33:52,487 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-02-06 12:33:52,487 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 235 flow [2025-02-06 12:33:52,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:52,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:52,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:33:52,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:52,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash -576181152, now seen corresponding path program 1 times [2025-02-06 12:33:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:52,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779871484] [2025-02-06 12:33:52,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:52,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:52,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:33:52,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:33:52,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779871484] [2025-02-06 12:33:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779871484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:52,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485665282] [2025-02-06 12:33:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:52,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:52,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:52,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-02-06 12:33:52,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:52,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-02-06 12:33:52,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:53,157 INFO L124 PetriNetUnfolderBase]: 1392/3119 cut-off events. [2025-02-06 12:33:53,158 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-02-06 12:33:53,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3119 events. 1392/3119 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18132 event pairs, 1089 based on Foata normal form. 0/2730 useless extension candidates. Maximal degree in co-relation 5497. Up to 2216 conditions per place. [2025-02-06 12:33:53,168 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2025-02-06 12:33:53,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 355 flow [2025-02-06 12:33:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-02-06 12:33:53,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6996124031007752 [2025-02-06 12:33:53,169 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 235 flow. Second operand 3 states and 361 transitions. [2025-02-06 12:33:53,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 355 flow [2025-02-06 12:33:53,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:53,172 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 232 flow [2025-02-06 12:33:53,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=107, PETRI_TRANSITIONS=108} [2025-02-06 12:33:53,173 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-02-06 12:33:53,174 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 232 flow [2025-02-06 12:33:53,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:53,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:53,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:33:53,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash -576181153, now seen corresponding path program 1 times [2025-02-06 12:33:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167161693] [2025-02-06 12:33:53,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:53,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:33:53,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:33:53,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:53,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167161693] [2025-02-06 12:33:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167161693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:53,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:53,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982978719] [2025-02-06 12:33:53,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:53,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:53,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:53,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:53,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-02-06 12:33:53,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:53,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-02-06 12:33:53,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:53,779 INFO L124 PetriNetUnfolderBase]: 1392/3052 cut-off events. [2025-02-06 12:33:53,780 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 12:33:53,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 3052 events. 1392/3052 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17356 event pairs, 1089 based on Foata normal form. 77/2795 useless extension candidates. Maximal degree in co-relation 5417. Up to 2216 conditions per place. [2025-02-06 12:33:53,788 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2025-02-06 12:33:53,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 348 flow [2025-02-06 12:33:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-02-06 12:33:53,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-02-06 12:33:53,790 INFO L175 Difference]: Start difference. First operand has 107 places, 108 transitions, 232 flow. Second operand 3 states and 357 transitions. [2025-02-06 12:33:53,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 348 flow [2025-02-06 12:33:53,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 105 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:53,791 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 227 flow [2025-02-06 12:33:53,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2025-02-06 12:33:53,792 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -57 predicate places. [2025-02-06 12:33:53,792 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 227 flow [2025-02-06 12:33:53,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:53,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:53,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:33:53,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash -681744132, now seen corresponding path program 1 times [2025-02-06 12:33:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50017705] [2025-02-06 12:33:53,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:53,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:33:53,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:33:53,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:53,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:53,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50017705] [2025-02-06 12:33:53,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50017705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:53,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:53,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56838686] [2025-02-06 12:33:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:53,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:53,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:53,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:54,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-02-06 12:33:54,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:54,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:54,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-02-06 12:33:54,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:54,488 INFO L124 PetriNetUnfolderBase]: 1409/3045 cut-off events. [2025-02-06 12:33:54,488 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 12:33:54,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 3045 events. 1409/3045 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17110 event pairs, 1074 based on Foata normal form. 0/2747 useless extension candidates. Maximal degree in co-relation 5443. Up to 2186 conditions per place. [2025-02-06 12:33:54,497 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 68 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2025-02-06 12:33:54,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 384 flow [2025-02-06 12:33:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2025-02-06 12:33:54,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6255813953488372 [2025-02-06 12:33:54,500 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 227 flow. Second operand 5 states and 538 transitions. [2025-02-06 12:33:54,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 384 flow [2025-02-06 12:33:54,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:54,501 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 230 flow [2025-02-06 12:33:54,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-02-06 12:33:54,503 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-02-06 12:33:54,503 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 230 flow [2025-02-06 12:33:54,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:54,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:54,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:54,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:33:54,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:54,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash -681744131, now seen corresponding path program 1 times [2025-02-06 12:33:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622032749] [2025-02-06 12:33:54,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:54,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:33:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:33:54,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:54,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622032749] [2025-02-06 12:33:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622032749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:54,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482752519] [2025-02-06 12:33:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:54,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:54,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:55,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-02-06 12:33:55,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:55,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:55,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-02-06 12:33:55,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:55,439 INFO L124 PetriNetUnfolderBase]: 1392/3004 cut-off events. [2025-02-06 12:33:55,439 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 12:33:55,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5402 conditions, 3004 events. 1392/3004 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16851 event pairs, 1074 based on Foata normal form. 24/2730 useless extension candidates. Maximal degree in co-relation 5397. Up to 2186 conditions per place. [2025-02-06 12:33:55,447 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 66 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-02-06 12:33:55,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 383 flow [2025-02-06 12:33:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2025-02-06 12:33:55,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523255813953488 [2025-02-06 12:33:55,453 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 230 flow. Second operand 5 states and 561 transitions. [2025-02-06 12:33:55,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 383 flow [2025-02-06 12:33:55,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 375 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:55,455 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 226 flow [2025-02-06 12:33:55,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2025-02-06 12:33:55,455 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-02-06 12:33:55,455 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 226 flow [2025-02-06 12:33:55,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:55,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:55,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:55,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:33:55,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:55,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 340738021, now seen corresponding path program 1 times [2025-02-06 12:33:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:55,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804115719] [2025-02-06 12:33:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:55,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:33:55,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:33:55,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:55,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804115719] [2025-02-06 12:33:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804115719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:55,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798980043] [2025-02-06 12:33:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:55,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:55,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:55,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-02-06 12:33:55,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:55,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:55,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-02-06 12:33:55,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:55,832 INFO L124 PetriNetUnfolderBase]: 1380/2992 cut-off events. [2025-02-06 12:33:55,833 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 12:33:55,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 2992 events. 1380/2992 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16804 event pairs, 1074 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 5372. Up to 2176 conditions per place. [2025-02-06 12:33:55,841 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 66 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-02-06 12:33:55,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 377 flow [2025-02-06 12:33:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-02-06 12:33:55,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7189922480620154 [2025-02-06 12:33:55,842 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 226 flow. Second operand 3 states and 371 transitions. [2025-02-06 12:33:55,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 377 flow [2025-02-06 12:33:55,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 369 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:55,844 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 220 flow [2025-02-06 12:33:55,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2025-02-06 12:33:55,846 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -60 predicate places. [2025-02-06 12:33:55,846 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 220 flow [2025-02-06 12:33:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:55,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:55,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:55,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:33:55,846 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:55,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash -436164801, now seen corresponding path program 1 times [2025-02-06 12:33:55,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:55,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817450819] [2025-02-06 12:33:55,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:55,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:33:55,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:33:55,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:55,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:56,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817450819] [2025-02-06 12:33:56,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817450819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:56,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:56,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:33:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303203379] [2025-02-06 12:33:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:56,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:33:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:56,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:33:56,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:33:57,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 172 [2025-02-06 12:33:57,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:57,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:57,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 172 [2025-02-06 12:33:57,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:57,484 INFO L124 PetriNetUnfolderBase]: 1717/3481 cut-off events. [2025-02-06 12:33:57,484 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 12:33:57,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6487 conditions, 3481 events. 1717/3481 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19021 event pairs, 388 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 6482. Up to 2364 conditions per place. [2025-02-06 12:33:57,495 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 110 selfloop transitions, 12 changer transitions 0/152 dead transitions. [2025-02-06 12:33:57,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 152 transitions, 577 flow [2025-02-06 12:33:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:33:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:33:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 850 transitions. [2025-02-06 12:33:57,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177325581395349 [2025-02-06 12:33:57,501 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 220 flow. Second operand 8 states and 850 transitions. [2025-02-06 12:33:57,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 152 transitions, 577 flow [2025-02-06 12:33:57,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 152 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:57,511 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 252 flow [2025-02-06 12:33:57,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2025-02-06 12:33:57,514 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-02-06 12:33:57,514 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 252 flow [2025-02-06 12:33:57,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:57,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:57,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:57,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:33:57,516 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1976594070, now seen corresponding path program 1 times [2025-02-06 12:33:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142731867] [2025-02-06 12:33:57,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:57,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 12:33:57,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 12:33:57,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:57,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:59,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142731867] [2025-02-06 12:33:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142731867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:59,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:59,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:33:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750479884] [2025-02-06 12:33:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:59,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:33:59,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:59,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:33:59,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:34:00,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 172 [2025-02-06 12:34:00,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 252 flow. Second operand has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:00,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:00,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 172 [2025-02-06 12:34:00,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:00,840 INFO L124 PetriNetUnfolderBase]: 1711/3420 cut-off events. [2025-02-06 12:34:00,840 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-02-06 12:34:00,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6719 conditions, 3420 events. 1711/3420 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 18731 event pairs, 438 based on Foata normal form. 0/3216 useless extension candidates. Maximal degree in co-relation 6713. Up to 2065 conditions per place. [2025-02-06 12:34:00,849 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 129 selfloop transitions, 14 changer transitions 0/170 dead transitions. [2025-02-06 12:34:00,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 170 transitions, 686 flow [2025-02-06 12:34:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:34:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 12:34:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1323 transitions. [2025-02-06 12:34:00,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5916815742397138 [2025-02-06 12:34:00,859 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 252 flow. Second operand 13 states and 1323 transitions. [2025-02-06 12:34:00,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 170 transitions, 686 flow [2025-02-06 12:34:00,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 170 transitions, 666 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 12:34:00,865 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 260 flow [2025-02-06 12:34:00,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=260, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2025-02-06 12:34:00,865 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-02-06 12:34:00,866 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 260 flow [2025-02-06 12:34:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:00,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:00,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:00,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:34:00,867 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:00,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1096243311, now seen corresponding path program 1 times [2025-02-06 12:34:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47783254] [2025-02-06 12:34:00,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:00,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:34:00,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:34:00,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:00,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47783254] [2025-02-06 12:34:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47783254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:02,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:02,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:34:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897089368] [2025-02-06 12:34:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:34:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:02,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:34:02,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:34:02,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2025-02-06 12:34:02,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:02,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:02,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2025-02-06 12:34:02,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:03,457 INFO L124 PetriNetUnfolderBase]: 2375/4664 cut-off events. [2025-02-06 12:34:03,458 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-02-06 12:34:03,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9286 conditions, 4664 events. 2375/4664 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 27673 event pairs, 226 based on Foata normal form. 56/4467 useless extension candidates. Maximal degree in co-relation 9279. Up to 2173 conditions per place. [2025-02-06 12:34:03,468 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 154 selfloop transitions, 19 changer transitions 0/201 dead transitions. [2025-02-06 12:34:03,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 201 transitions, 851 flow [2025-02-06 12:34:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:34:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:34:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 982 transitions. [2025-02-06 12:34:03,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5190274841437632 [2025-02-06 12:34:03,470 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 260 flow. Second operand 11 states and 982 transitions. [2025-02-06 12:34:03,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 201 transitions, 851 flow [2025-02-06 12:34:03,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 201 transitions, 827 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-02-06 12:34:03,473 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 346 flow [2025-02-06 12:34:03,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=346, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-02-06 12:34:03,474 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-02-06 12:34:03,474 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 346 flow [2025-02-06 12:34:03,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:03,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:03,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:03,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:34:03,475 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash 573709039, now seen corresponding path program 1 times [2025-02-06 12:34:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:03,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739978558] [2025-02-06 12:34:03,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:03,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:34:03,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:34:03,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:34:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739978558] [2025-02-06 12:34:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739978558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:03,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684714653] [2025-02-06 12:34:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:03,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:03,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:03,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:03,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-02-06 12:34:03,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:03,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:03,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-02-06 12:34:03,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:03,948 INFO L124 PetriNetUnfolderBase]: 3330/7336 cut-off events. [2025-02-06 12:34:03,949 INFO L125 PetriNetUnfolderBase]: For 1674/1740 co-relation queries the response was YES. [2025-02-06 12:34:03,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14805 conditions, 7336 events. 3330/7336 cut-off events. For 1674/1740 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 54532 event pairs, 1499 based on Foata normal form. 183/6962 useless extension candidates. Maximal degree in co-relation 14794. Up to 3222 conditions per place. [2025-02-06 12:34:03,975 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 127 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-02-06 12:34:03,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 823 flow [2025-02-06 12:34:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2025-02-06 12:34:03,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7887596899224806 [2025-02-06 12:34:03,977 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 346 flow. Second operand 3 states and 407 transitions. [2025-02-06 12:34:03,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 823 flow [2025-02-06 12:34:03,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 788 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 12:34:03,981 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 338 flow [2025-02-06 12:34:03,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-02-06 12:34:03,981 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-02-06 12:34:03,981 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 338 flow [2025-02-06 12:34:03,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:03,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:03,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:03,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:34:03,982 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1254586864, now seen corresponding path program 1 times [2025-02-06 12:34:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636192915] [2025-02-06 12:34:03,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:04,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 12:34:04,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 12:34:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:04,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 12:34:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636192915] [2025-02-06 12:34:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636192915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:34:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378825986] [2025-02-06 12:34:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:04,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:34:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:04,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:34:04,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:34:04,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-02-06 12:34:04,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:04,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:04,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-02-06 12:34:04,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:04,730 INFO L124 PetriNetUnfolderBase]: 4187/8359 cut-off events. [2025-02-06 12:34:04,731 INFO L125 PetriNetUnfolderBase]: For 2335/2373 co-relation queries the response was YES. [2025-02-06 12:34:04,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18414 conditions, 8359 events. 4187/8359 cut-off events. For 2335/2373 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 58947 event pairs, 2277 based on Foata normal form. 92/7972 useless extension candidates. Maximal degree in co-relation 18401. Up to 5629 conditions per place. [2025-02-06 12:34:04,761 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 104 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-02-06 12:34:04,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 144 transitions, 667 flow [2025-02-06 12:34:04,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:34:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:34:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2025-02-06 12:34:04,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-02-06 12:34:04,766 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 338 flow. Second operand 4 states and 488 transitions. [2025-02-06 12:34:04,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 144 transitions, 667 flow [2025-02-06 12:34:04,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 144 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:04,774 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 352 flow [2025-02-06 12:34:04,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2025-02-06 12:34:04,775 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-02-06 12:34:04,775 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 352 flow [2025-02-06 12:34:04,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:04,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:04,775 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:34:04,775 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1927667799, now seen corresponding path program 1 times [2025-02-06 12:34:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603573014] [2025-02-06 12:34:04,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:04,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:34:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:34:04,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:04,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 12:34:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603573014] [2025-02-06 12:34:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603573014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:04,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395068060] [2025-02-06 12:34:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:04,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:04,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:04,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-02-06 12:34:04,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:04,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:04,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-02-06 12:34:04,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:05,186 INFO L124 PetriNetUnfolderBase]: 2481/5241 cut-off events. [2025-02-06 12:34:05,186 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2025-02-06 12:34:05,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11257 conditions, 5241 events. 2481/5241 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33855 event pairs, 1218 based on Foata normal form. 124/5112 useless extension candidates. Maximal degree in co-relation 11243. Up to 2282 conditions per place. [2025-02-06 12:34:05,201 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-02-06 12:34:05,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 523 flow [2025-02-06 12:34:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-02-06 12:34:05,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-02-06 12:34:05,203 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 352 flow. Second operand 3 states and 374 transitions. [2025-02-06 12:34:05,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 523 flow [2025-02-06 12:34:05,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 119 transitions, 501 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-06 12:34:05,208 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 304 flow [2025-02-06 12:34:05,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-02-06 12:34:05,209 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-02-06 12:34:05,209 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 304 flow [2025-02-06 12:34:05,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:05,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:05,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:05,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:34:05,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -38326312, now seen corresponding path program 1 times [2025-02-06 12:34:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60487637] [2025-02-06 12:34:05,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:05,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 12:34:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 12:34:05,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:05,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 12:34:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60487637] [2025-02-06 12:34:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60487637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:05,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:05,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:05,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173786990] [2025-02-06 12:34:05,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:05,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:05,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:05,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:05,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:05,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-02-06 12:34:05,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:05,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:05,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-02-06 12:34:05,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:05,873 INFO L124 PetriNetUnfolderBase]: 1512/3599 cut-off events. [2025-02-06 12:34:05,874 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-02-06 12:34:05,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7823 conditions, 3599 events. 1512/3599 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 21546 event pairs, 368 based on Foata normal form. 218/3648 useless extension candidates. Maximal degree in co-relation 7810. Up to 1849 conditions per place. [2025-02-06 12:34:05,979 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 72 selfloop transitions, 6 changer transitions 0/116 dead transitions. [2025-02-06 12:34:05,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 504 flow [2025-02-06 12:34:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-02-06 12:34:05,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-02-06 12:34:05,981 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 304 flow. Second operand 3 states and 374 transitions. [2025-02-06 12:34:05,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 504 flow [2025-02-06 12:34:05,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:34:05,984 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 310 flow [2025-02-06 12:34:05,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-02-06 12:34:05,985 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-02-06 12:34:05,985 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 310 flow [2025-02-06 12:34:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:05,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:05,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:05,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:34:05,985 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:05,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2052953466, now seen corresponding path program 1 times [2025-02-06 12:34:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177301767] [2025-02-06 12:34:05,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:06,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:34:06,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:34:06,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:06,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 12:34:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177301767] [2025-02-06 12:34:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177301767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:06,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:34:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288930716] [2025-02-06 12:34:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:06,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:34:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:06,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:34:06,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:34:06,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-02-06 12:34:06,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:06,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:06,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-02-06 12:34:06,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:06,844 INFO L124 PetriNetUnfolderBase]: 1512/3346 cut-off events. [2025-02-06 12:34:06,844 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2025-02-06 12:34:06,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 3346 events. 1512/3346 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18727 event pairs, 1021 based on Foata normal form. 126/3380 useless extension candidates. Maximal degree in co-relation 7855. Up to 2206 conditions per place. [2025-02-06 12:34:06,853 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 67 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-02-06 12:34:06,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 455 flow [2025-02-06 12:34:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:34:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:34:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2025-02-06 12:34:06,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6209302325581395 [2025-02-06 12:34:06,854 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 310 flow. Second operand 5 states and 534 transitions. [2025-02-06 12:34:06,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 455 flow [2025-02-06 12:34:06,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:06,857 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 298 flow [2025-02-06 12:34:06,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2025-02-06 12:34:06,857 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-02-06 12:34:06,857 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 298 flow [2025-02-06 12:34:06,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:06,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:06,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:34:06,858 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1844856935, now seen corresponding path program 1 times [2025-02-06 12:34:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422350134] [2025-02-06 12:34:06,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:06,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:34:06,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:34:06,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:06,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 12:34:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422350134] [2025-02-06 12:34:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422350134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812279012] [2025-02-06 12:34:06,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:06,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:06,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:06,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:06,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:34:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:34:07,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:34:07,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:07,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:07,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:34:07,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 12:34:07,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:34:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812279012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:07,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:34:07,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-02-06 12:34:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955876296] [2025-02-06 12:34:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:07,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:34:07,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-02-06 12:34:07,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:07,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:07,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-02-06 12:34:07,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:07,485 INFO L124 PetriNetUnfolderBase]: 1512/3349 cut-off events. [2025-02-06 12:34:07,486 INFO L125 PetriNetUnfolderBase]: For 1157/1157 co-relation queries the response was YES. [2025-02-06 12:34:07,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 3349 events. 1512/3349 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18778 event pairs, 1201 based on Foata normal form. 5/3248 useless extension candidates. Maximal degree in co-relation 7741. Up to 2625 conditions per place. [2025-02-06 12:34:07,495 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 63 selfloop transitions, 1 changer transitions 2/95 dead transitions. [2025-02-06 12:34:07,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 95 transitions, 426 flow [2025-02-06 12:34:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-02-06 12:34:07,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-02-06 12:34:07,496 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 298 flow. Second operand 3 states and 358 transitions. [2025-02-06 12:34:07,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 95 transitions, 426 flow [2025-02-06 12:34:07,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:34:07,499 INFO L231 Difference]: Finished difference. Result has 104 places, 93 transitions, 285 flow [2025-02-06 12:34:07,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=104, PETRI_TRANSITIONS=93} [2025-02-06 12:34:07,500 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-02-06 12:34:07,500 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 93 transitions, 285 flow [2025-02-06 12:34:07,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:07,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:07,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:07,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:34:07,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 12:34:07,701 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash 823109127, now seen corresponding path program 1 times [2025-02-06 12:34:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:07,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78871061] [2025-02-06 12:34:07,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:07,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:34:07,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:34:07,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:07,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:34:09,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:09,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78871061] [2025-02-06 12:34:09,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78871061] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:09,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319883150] [2025-02-06 12:34:09,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:09,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:09,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:09,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:09,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:34:09,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:34:09,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:34:09,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:09,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 2005 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-06 12:34:09,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:09,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:34:09,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 12:34:09,459 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:34:09,470 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-02-06 12:34:09,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-02-06 12:34:09,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:34:09,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 12:34:09,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-06 12:34:09,644 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-06 12:34:09,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2025-02-06 12:34:09,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 12:34:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:34:09,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:34:18,627 INFO L349 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2025-02-06 12:34:18,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 288 treesize of output 273 [2025-02-06 12:34:18,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:34:18,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 174 [2025-02-06 12:34:18,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2025-02-06 12:34:18,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:34:18,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 159 [2025-02-06 12:34:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:34:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319883150] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:34:18,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:34:18,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2025-02-06 12:34:18,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191841074] [2025-02-06 12:34:18,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:34:18,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 12:34:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:18,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 12:34:18,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 12:34:24,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:29,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:36,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:39,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:42,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:46,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:51,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:56,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:35:04,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]