./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:42:21,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:42:21,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:42:21,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:42:21,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:42:21,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:42:21,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:42:21,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:42:21,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:42:21,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:42:21,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:42:21,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:42:21,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:42:21,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:42:21,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:42:21,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:42:21,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:42:21,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:42:21,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:42:21,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:42:21,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:42:21,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:42:21,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:42:21,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:42:21,239 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-03-04 09:42:21,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:42:21,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:42:21,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:42:21,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:42:21,466 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:42:21,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-03-04 09:42:22,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7471947a7/37c8118857ae4447812ab7be7df46f01/FLAGa91234cf2 [2025-03-04 09:42:22,880 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:42:22,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-03-04 09:42:22,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7471947a7/37c8118857ae4447812ab7be7df46f01/FLAGa91234cf2 [2025-03-04 09:42:23,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7471947a7/37c8118857ae4447812ab7be7df46f01 [2025-03-04 09:42:23,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:42:23,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:42:23,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:42:23,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:42:23,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:42:23,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7fb926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23, skipping insertion in model container [2025-03-04 09:42:23,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:42:23,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:42:23,505 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:42:23,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:42:23,597 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:42:23,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23 WrapperNode [2025-03-04 09:42:23,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:42:23,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:42:23,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:42:23,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:42:23,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,644 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 235 [2025-03-04 09:42:23,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:42:23,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:42:23,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:42:23,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:42:23,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,672 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-03-04 09:42:23,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:42:23,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:42:23,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:42:23,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:42:23,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (1/1) ... [2025-03-04 09:42:23,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:42:23,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:42:23,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:42:23,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:42:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:42:23,755 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:42:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:42:23,755 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:42:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:42:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 09:42:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:42:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:42:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:42:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:42:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:42:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 09:42:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:42:23,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:42:23,758 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:42:23,895 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:42:23,896 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:42:24,259 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:42:24,259 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:42:24,404 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:42:24,405 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:42:24,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:42:24 BoogieIcfgContainer [2025-03-04 09:42:24,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:42:24,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:42:24,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:42:24,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:42:24,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:42:23" (1/3) ... [2025-03-04 09:42:24,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e3a199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:42:24, skipping insertion in model container [2025-03-04 09:42:24,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:23" (2/3) ... [2025-03-04 09:42:24,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e3a199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:42:24, skipping insertion in model container [2025-03-04 09:42:24,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:42:24" (3/3) ... [2025-03-04 09:42:24,411 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-03-04 09:42:24,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:42:24,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 119 locations, 1 initial locations, 2 loop locations, and 53 error locations. [2025-03-04 09:42:24,423 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:42:24,497 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:42:24,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2025-03-04 09:42:24,586 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2025-03-04 09:42:24,589 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:42:24,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 127 events. 11/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 397 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2025-03-04 09:42:24,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2025-03-04 09:42:24,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2025-03-04 09:42:24,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:42:24,615 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2519b136, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:42:24,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-03-04 09:42:24,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:42:24,621 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 09:42:24,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:42:24,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:24,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:42:24,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:24,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 21643, now seen corresponding path program 1 times [2025-03-04 09:42:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:24,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702245577] [2025-03-04 09:42:24,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:42:24,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:42:24,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:24,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702245577] [2025-03-04 09:42:24,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702245577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:24,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:24,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:42:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443780393] [2025-03-04 09:42:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:24,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:24,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2025-03-04 09:42:24,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:24,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:24,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2025-03-04 09:42:24,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:25,331 INFO L124 PetriNetUnfolderBase]: 1087/2983 cut-off events. [2025-03-04 09:42:25,331 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-04 09:42:25,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2983 events. 1087/2983 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23587 event pairs, 837 based on Foata normal form. 68/2108 useless extension candidates. Maximal degree in co-relation 4566. Up to 1686 conditions per place. [2025-03-04 09:42:25,348 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-03-04 09:42:25,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2025-03-04 09:42:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-03-04 09:42:25,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2025-03-04 09:42:25,358 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2025-03-04 09:42:25,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2025-03-04 09:42:25,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:25,365 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2025-03-04 09:42:25,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2025-03-04 09:42:25,372 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2025-03-04 09:42:25,372 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2025-03-04 09:42:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:25,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:25,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:42:25,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:42:25,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:25,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:25,373 INFO L85 PathProgramCache]: Analyzing trace with hash 21644, now seen corresponding path program 1 times [2025-03-04 09:42:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:25,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107129291] [2025-03-04 09:42:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:25,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:42:25,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:42:25,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:25,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107129291] [2025-03-04 09:42:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107129291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:25,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:42:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103263285] [2025-03-04 09:42:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:25,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:25,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:25,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:25,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2025-03-04 09:42:25,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:25,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:25,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2025-03-04 09:42:25,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:25,901 INFO L124 PetriNetUnfolderBase]: 1087/2980 cut-off events. [2025-03-04 09:42:25,902 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 09:42:25,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 2980 events. 1087/2980 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23577 event pairs, 837 based on Foata normal form. 3/2042 useless extension candidates. Maximal degree in co-relation 4675. Up to 1686 conditions per place. [2025-03-04 09:42:25,919 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 09:42:25,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2025-03-04 09:42:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-03-04 09:42:25,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2025-03-04 09:42:25,922 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2025-03-04 09:42:25,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2025-03-04 09:42:25,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:25,926 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2025-03-04 09:42:25,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2025-03-04 09:42:25,927 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2025-03-04 09:42:25,927 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2025-03-04 09:42:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:25,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:25,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:42:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:42:25,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 645326531, now seen corresponding path program 1 times [2025-03-04 09:42:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504743943] [2025-03-04 09:42:25,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:25,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:42:25,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:42:25,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:25,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:26,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:26,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504743943] [2025-03-04 09:42:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504743943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:26,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609626612] [2025-03-04 09:42:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:26,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:26,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:26,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:26,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-03-04 09:42:26,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:26,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:26,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-03-04 09:42:26,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:26,312 INFO L124 PetriNetUnfolderBase]: 1087/2978 cut-off events. [2025-03-04 09:42:26,312 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 09:42:26,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2978 events. 1087/2978 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23611 event pairs, 837 based on Foata normal form. 1/2040 useless extension candidates. Maximal degree in co-relation 4673. Up to 1685 conditions per place. [2025-03-04 09:42:26,328 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-03-04 09:42:26,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2025-03-04 09:42:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2025-03-04 09:42:26,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2025-03-04 09:42:26,332 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2025-03-04 09:42:26,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2025-03-04 09:42:26,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:26,333 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2025-03-04 09:42:26,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-03-04 09:42:26,334 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2025-03-04 09:42:26,334 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2025-03-04 09:42:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:26,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:26,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:42:26,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:42:26,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 645326532, now seen corresponding path program 1 times [2025-03-04 09:42:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20363397] [2025-03-04 09:42:26,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:26,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:42:26,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:42:26,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:26,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:26,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:26,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20363397] [2025-03-04 09:42:26,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20363397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:26,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:26,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262448753] [2025-03-04 09:42:26,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:26,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:26,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:26,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:26,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-03-04 09:42:26,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:26,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:26,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-03-04 09:42:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:26,878 INFO L124 PetriNetUnfolderBase]: 1087/2976 cut-off events. [2025-03-04 09:42:26,878 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:42:26,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 2976 events. 1087/2976 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23576 event pairs, 837 based on Foata normal form. 2/2040 useless extension candidates. Maximal degree in co-relation 4668. Up to 1685 conditions per place. [2025-03-04 09:42:26,888 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-03-04 09:42:26,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 318 flow [2025-03-04 09:42:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2025-03-04 09:42:26,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2025-03-04 09:42:26,890 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 337 transitions. [2025-03-04 09:42:26,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 318 flow [2025-03-04 09:42:26,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:42:26,891 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2025-03-04 09:42:26,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-03-04 09:42:26,892 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2025-03-04 09:42:26,892 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2025-03-04 09:42:26,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:26,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:26,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:26,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:42:26,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:26,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1133545387, now seen corresponding path program 1 times [2025-03-04 09:42:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979499219] [2025-03-04 09:42:26,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:42:26,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:42:26,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:26,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:27,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:27,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979499219] [2025-03-04 09:42:27,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979499219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:27,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471780211] [2025-03-04 09:42:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:42:27,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:27,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:42:27,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:42:27,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2025-03-04 09:42:27,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:27,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:27,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2025-03-04 09:42:27,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:27,507 INFO L124 PetriNetUnfolderBase]: 1044/2659 cut-off events. [2025-03-04 09:42:27,507 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:42:27,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 2659 events. 1044/2659 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 20000 event pairs, 424 based on Foata normal form. 120/2115 useless extension candidates. Maximal degree in co-relation 4306. Up to 878 conditions per place. [2025-03-04 09:42:27,517 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 66 selfloop transitions, 4 changer transitions 0/123 dead transitions. [2025-03-04 09:42:27,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 123 transitions, 397 flow [2025-03-04 09:42:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2025-03-04 09:42:27,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6387596899224807 [2025-03-04 09:42:27,519 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 5 states and 412 transitions. [2025-03-04 09:42:27,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 123 transitions, 397 flow [2025-03-04 09:42:27,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 123 transitions, 391 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:42:27,521 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 212 flow [2025-03-04 09:42:27,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2025-03-04 09:42:27,522 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -22 predicate places. [2025-03-04 09:42:27,522 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 212 flow [2025-03-04 09:42:27,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:27,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:27,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:27,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:42:27,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:27,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1133545386, now seen corresponding path program 1 times [2025-03-04 09:42:27,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:27,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861302126] [2025-03-04 09:42:27,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:27,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:42:27,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:42:27,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:27,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:27,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861302126] [2025-03-04 09:42:27,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861302126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:27,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:27,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425600921] [2025-03-04 09:42:27,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:27,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:27,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:27,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:27,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2025-03-04 09:42:27,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 100 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:27,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:27,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2025-03-04 09:42:27,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:27,885 INFO L124 PetriNetUnfolderBase]: 1044/2353 cut-off events. [2025-03-04 09:42:27,885 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-04 09:42:27,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4094 conditions, 2353 events. 1044/2353 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15827 event pairs, 424 based on Foata normal form. 120/1999 useless extension candidates. Maximal degree in co-relation 1945. Up to 879 conditions per place. [2025-03-04 09:42:27,893 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-03-04 09:42:27,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 383 flow [2025-03-04 09:42:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2025-03-04 09:42:27,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2025-03-04 09:42:27,894 INFO L175 Difference]: Start difference. First operand has 100 places, 100 transitions, 212 flow. Second operand 4 states and 342 transitions. [2025-03-04 09:42:27,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 383 flow [2025-03-04 09:42:27,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:27,897 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 194 flow [2025-03-04 09:42:27,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2025-03-04 09:42:27,898 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -31 predicate places. [2025-03-04 09:42:27,899 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 194 flow [2025-03-04 09:42:27,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:27,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:27,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:27,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:42:27,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:27,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 780169241, now seen corresponding path program 1 times [2025-03-04 09:42:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329752769] [2025-03-04 09:42:27,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:27,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:42:27,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:42:27,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:27,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:28,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329752769] [2025-03-04 09:42:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329752769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:42:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705326943] [2025-03-04 09:42:28,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:28,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:42:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:28,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:42:28,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:42:28,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2025-03-04 09:42:28,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:28,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:28,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2025-03-04 09:42:28,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:28,955 INFO L124 PetriNetUnfolderBase]: 2063/4250 cut-off events. [2025-03-04 09:42:28,956 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-04 09:42:28,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 4250 events. 2063/4250 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29501 event pairs, 287 based on Foata normal form. 0/3446 useless extension candidates. Maximal degree in co-relation 2867. Up to 2157 conditions per place. [2025-03-04 09:42:28,971 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 132 selfloop transitions, 11 changer transitions 0/182 dead transitions. [2025-03-04 09:42:28,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 182 transitions, 667 flow [2025-03-04 09:42:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:42:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:42:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 551 transitions. [2025-03-04 09:42:28,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101882613510521 [2025-03-04 09:42:28,975 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 194 flow. Second operand 7 states and 551 transitions. [2025-03-04 09:42:28,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 182 transitions, 667 flow [2025-03-04 09:42:28,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:42:28,980 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 262 flow [2025-03-04 09:42:28,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2025-03-04 09:42:28,980 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2025-03-04 09:42:28,980 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 262 flow [2025-03-04 09:42:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:28,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:28,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:42:28,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash -807283610, now seen corresponding path program 1 times [2025-03-04 09:42:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997136242] [2025-03-04 09:42:28,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:28,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:42:28,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:42:28,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997136242] [2025-03-04 09:42:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997136242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:29,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931164269] [2025-03-04 09:42:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:29,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:29,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:29,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-03-04 09:42:29,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:29,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:29,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-03-04 09:42:29,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:29,380 INFO L124 PetriNetUnfolderBase]: 1788/4083 cut-off events. [2025-03-04 09:42:29,381 INFO L125 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2025-03-04 09:42:29,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7510 conditions, 4083 events. 1788/4083 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 30789 event pairs, 1242 based on Foata normal form. 64/3283 useless extension candidates. Maximal degree in co-relation 7125. Up to 2610 conditions per place. [2025-03-04 09:42:29,393 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 74 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-03-04 09:42:29,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 477 flow [2025-03-04 09:42:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2025-03-04 09:42:29,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.687984496124031 [2025-03-04 09:42:29,395 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 262 flow. Second operand 4 states and 355 transitions. [2025-03-04 09:42:29,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 477 flow [2025-03-04 09:42:29,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:29,398 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 262 flow [2025-03-04 09:42:29,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-03-04 09:42:29,398 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2025-03-04 09:42:29,399 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 262 flow [2025-03-04 09:42:29,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:29,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:29,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:29,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:42:29,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:29,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -807283609, now seen corresponding path program 1 times [2025-03-04 09:42:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:29,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206062588] [2025-03-04 09:42:29,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:29,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:42:29,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:42:29,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:29,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:29,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:29,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206062588] [2025-03-04 09:42:29,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206062588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:29,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:29,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515831073] [2025-03-04 09:42:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:29,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:29,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:29,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:29,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2025-03-04 09:42:29,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:29,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:29,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2025-03-04 09:42:29,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:29,566 INFO L124 PetriNetUnfolderBase]: 692/1626 cut-off events. [2025-03-04 09:42:29,566 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-03-04 09:42:29,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1626 events. 692/1626 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9826 event pairs, 446 based on Foata normal form. 45/1450 useless extension candidates. Maximal degree in co-relation 3073. Up to 693 conditions per place. [2025-03-04 09:42:29,570 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-03-04 09:42:29,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 391 flow [2025-03-04 09:42:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-03-04 09:42:29,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2025-03-04 09:42:29,572 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 262 flow. Second operand 3 states and 281 transitions. [2025-03-04 09:42:29,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 391 flow [2025-03-04 09:42:29,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 383 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:29,574 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 245 flow [2025-03-04 09:42:29,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-03-04 09:42:29,574 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -26 predicate places. [2025-03-04 09:42:29,575 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 245 flow [2025-03-04 09:42:29,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:29,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:29,575 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-03-04 09:42:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:42:29,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:29,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1023274309, now seen corresponding path program 1 times [2025-03-04 09:42:29,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:29,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819287444] [2025-03-04 09:42:29,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:29,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:42:29,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:42:29,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:29,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:29,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819287444] [2025-03-04 09:42:29,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819287444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:29,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:29,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:29,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688288788] [2025-03-04 09:42:29,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:29,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:29,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:29,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:29,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:29,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2025-03-04 09:42:29,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:29,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:29,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2025-03-04 09:42:29,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:29,755 INFO L124 PetriNetUnfolderBase]: 572/1370 cut-off events. [2025-03-04 09:42:29,755 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:42:29,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1370 events. 572/1370 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7404 event pairs, 380 based on Foata normal form. 12/1196 useless extension candidates. Maximal degree in co-relation 1700. Up to 753 conditions per place. [2025-03-04 09:42:29,760 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-03-04 09:42:29,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 397 flow [2025-03-04 09:42:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-03-04 09:42:29,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2025-03-04 09:42:29,761 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 245 flow. Second operand 3 states and 287 transitions. [2025-03-04 09:42:29,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 397 flow [2025-03-04 09:42:29,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 389 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:29,763 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 244 flow [2025-03-04 09:42:29,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2025-03-04 09:42:29,765 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2025-03-04 09:42:29,765 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 244 flow [2025-03-04 09:42:29,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:29,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:29,766 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-03-04 09:42:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:42:29,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:29,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1554101556, now seen corresponding path program 1 times [2025-03-04 09:42:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:29,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062300835] [2025-03-04 09:42:29,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:29,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:42:29,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:42:29,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:29,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062300835] [2025-03-04 09:42:29,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062300835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326332786] [2025-03-04 09:42:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:29,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:29,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:29,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:30,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2025-03-04 09:42:30,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:30,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:30,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2025-03-04 09:42:30,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:30,145 INFO L124 PetriNetUnfolderBase]: 587/1373 cut-off events. [2025-03-04 09:42:30,146 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-03-04 09:42:30,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1373 events. 587/1373 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7338 event pairs, 395 based on Foata normal form. 12/1223 useless extension candidates. Maximal degree in co-relation 1532. Up to 779 conditions per place. [2025-03-04 09:42:30,150 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-03-04 09:42:30,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 401 flow [2025-03-04 09:42:30,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2025-03-04 09:42:30,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-03-04 09:42:30,151 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2025-03-04 09:42:30,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 401 flow [2025-03-04 09:42:30,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:30,153 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 252 flow [2025-03-04 09:42:30,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2025-03-04 09:42:30,154 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -22 predicate places. [2025-03-04 09:42:30,154 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 252 flow [2025-03-04 09:42:30,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:30,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:30,154 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-03-04 09:42:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:42:30,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1554101555, now seen corresponding path program 1 times [2025-03-04 09:42:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554393770] [2025-03-04 09:42:30,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:30,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:42:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:42:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554393770] [2025-03-04 09:42:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554393770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:42:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425531145] [2025-03-04 09:42:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:30,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:30,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:30,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:30,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-03-04 09:42:30,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:30,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:30,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-03-04 09:42:30,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:30,358 INFO L124 PetriNetUnfolderBase]: 572/1325 cut-off events. [2025-03-04 09:42:30,358 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-03-04 09:42:30,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 1325 events. 572/1325 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6963 event pairs, 515 based on Foata normal form. 31/1203 useless extension candidates. Maximal degree in co-relation 898. Up to 1007 conditions per place. [2025-03-04 09:42:30,362 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2025-03-04 09:42:30,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 94 transitions, 350 flow [2025-03-04 09:42:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-03-04 09:42:30,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2025-03-04 09:42:30,363 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 252 flow. Second operand 3 states and 265 transitions. [2025-03-04 09:42:30,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 94 transitions, 350 flow [2025-03-04 09:42:30,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 344 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:42:30,365 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 244 flow [2025-03-04 09:42:30,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-03-04 09:42:30,365 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2025-03-04 09:42:30,365 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 244 flow [2025-03-04 09:42:30,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:30,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:30,366 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:42:30,366 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:30,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1507302901, now seen corresponding path program 1 times [2025-03-04 09:42:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168734873] [2025-03-04 09:42:30,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:30,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 09:42:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 09:42:30,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:30,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168734873] [2025-03-04 09:42:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168734873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:42:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031390785] [2025-03-04 09:42:30,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:30,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:42:30,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:42:30,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:42:30,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:42:30,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 09:42:30,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 09:42:30,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:30,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:30,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 09:42:30,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:42:30,867 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 11 treesize of output 7 [2025-03-04 09:42:30,894 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 23 treesize of output 11 [2025-03-04 09:42:31,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:31,004 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 27 treesize of output 11 [2025-03-04 09:42:31,024 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 23 treesize of output 11 [2025-03-04 09:42:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:31,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:42:31,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031390785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:31,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:42:31,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2025-03-04 09:42:31,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394440030] [2025-03-04 09:42:31,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:31,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:42:31,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:31,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:42:31,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:42:31,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 129 [2025-03-04 09:42:31,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 70.75) internal successors, (566), 8 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:31,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:31,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 129 [2025-03-04 09:42:31,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:31,523 INFO L124 PetriNetUnfolderBase]: 643/1386 cut-off events. [2025-03-04 09:42:31,524 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-04 09:42:31,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1386 events. 643/1386 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6891 event pairs, 168 based on Foata normal form. 0/1261 useless extension candidates. Maximal degree in co-relation 2829. Up to 771 conditions per place. [2025-03-04 09:42:31,530 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 87 selfloop transitions, 8 changer transitions 0/130 dead transitions. [2025-03-04 09:42:31,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 130 transitions, 509 flow [2025-03-04 09:42:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:42:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:42:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 571 transitions. [2025-03-04 09:42:31,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6323366555924695 [2025-03-04 09:42:31,532 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 244 flow. Second operand 7 states and 571 transitions. [2025-03-04 09:42:31,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 130 transitions, 509 flow [2025-03-04 09:42:31,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 130 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:31,534 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 270 flow [2025-03-04 09:42:31,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2025-03-04 09:42:31,535 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -18 predicate places. [2025-03-04 09:42:31,535 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 270 flow [2025-03-04 09:42:31,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.75) internal successors, (566), 8 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:42:31,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:31,536 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 09:42:31,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:42:31,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 09:42:31,741 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-03-04 09:42:31,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:31,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1810087051, now seen corresponding path program 1 times [2025-03-04 09:42:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783993795] [2025-03-04 09:42:31,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:42:31,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:42:31,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:31,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783993795] [2025-03-04 09:42:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783993795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:42:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521550433] [2025-03-04 09:42:32,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:32,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:42:32,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:42:32,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:42:32,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:42:32,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:42:32,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:42:32,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:32,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:32,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 09:42:32,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:42:32,706 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 11 treesize of output 7 [2025-03-04 09:42:32,734 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 23 treesize of output 11 [2025-03-04 09:42:32,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:32,877 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 27 treesize of output 11 [2025-03-04 09:42:32,895 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 23 treesize of output 11 [2025-03-04 09:42:32,961 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 19 treesize of output 11 [2025-03-04 09:42:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:33,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:42:58,619 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2025-03-04 09:42:58,619 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 210 treesize of output 234 [2025-03-04 09:42:58,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:42:58,635 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 83 treesize of output 83 [2025-03-04 09:42:58,647 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 8 treesize of output 4 [2025-03-04 09:42:58,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:42:58,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 69 [2025-03-04 09:42:58,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:58,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:58,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:42:58,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2025-03-04 09:42:58,730 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-04 09:42:58,732 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:42:58,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:58,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-04 09:42:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:58,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521550433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:42:58,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:42:58,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 32 [2025-03-04 09:42:58,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363254168] [2025-03-04 09:42:58,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:42:58,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 09:42:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:58,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 09:42:58,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=945, Unknown=1, NotChecked=0, Total=1122 [2025-03-04 09:43:03,562 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-03-04 09:43:07,739 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-03-04 09:43:11,960 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-03-04 09:43:16,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-03-04 09:43:20,147 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-03-04 09:43:24,575 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-03-04 09:43:29,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:34,096 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-03-04 09:43:36,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:40,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-03-04 09:43:44,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-03-04 09:43:48,365 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-03-04 09:43:50,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:55,189 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-03-04 09:43:59,321 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-03-04 09:44:03,423 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]