./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.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 b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:16:59,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:59,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:16:59,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:59,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:17:00,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:17:00,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:17:00,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:17:00,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:17:00,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:17:00,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:17:00,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:17:00,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:17:00,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:17:00,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:17:00,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:00,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:17:00,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:17:00,010 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 -> b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b [2025-03-17 14:17:00,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:17:00,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:17:00,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:17:00,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:17:00,240 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:17:00,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-17 14:17:01,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f8777b9/aba25513094e44dfb30c27ef188b7b19/FLAG94a05c30d [2025-03-17 14:17:01,620 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:17:01,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-17 14:17:01,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f8777b9/aba25513094e44dfb30c27ef188b7b19/FLAG94a05c30d [2025-03-17 14:17:01,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f8777b9/aba25513094e44dfb30c27ef188b7b19 [2025-03-17 14:17:01,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:17:01,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:17:01,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:01,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:17:01,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:17:01,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cadc921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01, skipping insertion in model container [2025-03-17 14:17:01,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:17:02,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:02,033 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:17:02,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:02,126 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:17:02,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02 WrapperNode [2025-03-17 14:17:02,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:02,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:02,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:17:02,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:17:02,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,167 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 226 [2025-03-17 14:17:02,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:02,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:17:02,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:17:02,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:17:02,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,206 INFO L175 MemorySlicer]: Split 90 memory accesses to 3 slices as follows [50, 16, 24]. 56 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 19 writes are split as follows [0, 1, 18]. [2025-03-17 14:17:02,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:17:02,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:17:02,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:17:02,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:17:02,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:02,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:02,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:17:02,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:17:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:17:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:17:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:17:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:17:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:17:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:17:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:17:02,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:17:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:17:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:17:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:17:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:17:02,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:17:02,293 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:17:02,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:17:02,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:17:02,911 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:17:02,911 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:17:03,172 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:17:03,173 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:17:03,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:03 BoogieIcfgContainer [2025-03-17 14:17:03,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:17:03,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:17:03,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:17:03,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:17:03,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:17:01" (1/3) ... [2025-03-17 14:17:03,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dbcaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:03, skipping insertion in model container [2025-03-17 14:17:03,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02" (2/3) ... [2025-03-17 14:17:03,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dbcaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:03, skipping insertion in model container [2025-03-17 14:17:03,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:03" (3/3) ... [2025-03-17 14:17:03,179 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-03-17 14:17:03,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:17:03,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 61 error locations. [2025-03-17 14:17:03,191 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:17:03,236 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:17:03,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 218 flow [2025-03-17 14:17:03,298 INFO L124 PetriNetUnfolderBase]: 1/106 cut-off events. [2025-03-17 14:17:03,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:03,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 1/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2025-03-17 14:17:03,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 218 flow [2025-03-17 14:17:03,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 215 flow [2025-03-17 14:17:03,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:17:03,353 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;@1525f763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:17:03,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-17 14:17:03,358 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:17:03,358 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-17 14:17:03,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:03,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:17:03,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 679683, now seen corresponding path program 1 times [2025-03-17 14:17:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011954137] [2025-03-17 14:17:03,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:03,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:17:03,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:17:03,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011954137] [2025-03-17 14:17:03,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011954137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:03,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:03,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176756760] [2025-03-17 14:17:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:03,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:03,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:03,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 107 [2025-03-17 14:17:03,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:03,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 107 [2025-03-17 14:17:03,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,928 INFO L124 PetriNetUnfolderBase]: 64/293 cut-off events. [2025-03-17 14:17:03,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:03,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 293 events. 64/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1325 event pairs, 63 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 376. Up to 157 conditions per place. [2025-03-17 14:17:03,933 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 30 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2025-03-17 14:17:03,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 275 flow [2025-03-17 14:17:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2025-03-17 14:17:03,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7133956386292835 [2025-03-17 14:17:03,947 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 215 flow. Second operand 3 states and 229 transitions. [2025-03-17 14:17:03,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 275 flow [2025-03-17 14:17:03,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:03,955 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 214 flow [2025-03-17 14:17:03,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2025-03-17 14:17:03,959 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-03-17 14:17:03,961 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 214 flow [2025-03-17 14:17:03,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:03,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:17:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:17:03,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:03,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash 679684, now seen corresponding path program 1 times [2025-03-17 14:17:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851915904] [2025-03-17 14:17:03,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:03,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:17:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:17:03,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:04,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851915904] [2025-03-17 14:17:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851915904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:04,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052365804] [2025-03-17 14:17:04,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:04,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:04,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:04,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 107 [2025-03-17 14:17:04,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:04,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:04,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 107 [2025-03-17 14:17:04,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:04,286 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-03-17 14:17:04,286 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 14:17:04,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 285 events. 64/285 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1282 event pairs, 63 based on Foata normal form. 8/226 useless extension candidates. Maximal degree in co-relation 395. Up to 157 conditions per place. [2025-03-17 14:17:04,289 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 26 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2025-03-17 14:17:04,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 266 flow [2025-03-17 14:17:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-03-17 14:17:04,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7383177570093458 [2025-03-17 14:17:04,293 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 214 flow. Second operand 3 states and 237 transitions. [2025-03-17 14:17:04,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 266 flow [2025-03-17 14:17:04,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:04,295 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 198 flow [2025-03-17 14:17:04,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2025-03-17 14:17:04,297 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-03-17 14:17:04,297 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 198 flow [2025-03-17 14:17:04,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:04,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:04,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:17:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:17:04,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:04,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash 653196081, now seen corresponding path program 1 times [2025-03-17 14:17:04,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:04,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93835981] [2025-03-17 14:17:04,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:04,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:17:04,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:17:04,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93835981] [2025-03-17 14:17:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93835981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607421783] [2025-03-17 14:17:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:04,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:04,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:04,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-03-17 14:17:04,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:04,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:04,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-03-17 14:17:04,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:04,786 INFO L124 PetriNetUnfolderBase]: 73/305 cut-off events. [2025-03-17 14:17:04,786 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:17:04,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 305 events. 73/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1386 event pairs, 72 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 437. Up to 183 conditions per place. [2025-03-17 14:17:04,791 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 38 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2025-03-17 14:17:04,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 264 flow [2025-03-17 14:17:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-03-17 14:17:04,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.719626168224299 [2025-03-17 14:17:04,793 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 198 flow. Second operand 3 states and 231 transitions. [2025-03-17 14:17:04,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 264 flow [2025-03-17 14:17:04,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:04,795 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 172 flow [2025-03-17 14:17:04,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-17 14:17:04,798 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-03-17 14:17:04,798 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 172 flow [2025-03-17 14:17:04,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:04,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:04,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:17:04,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:17:04,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:04,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash 653196082, now seen corresponding path program 1 times [2025-03-17 14:17:04,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:04,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269973186] [2025-03-17 14:17:04,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:04,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:17:04,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:17:04,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:04,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269973186] [2025-03-17 14:17:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269973186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906552519] [2025-03-17 14:17:05,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:05,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:05,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-17 14:17:05,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:05,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-17 14:17:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:05,335 INFO L124 PetriNetUnfolderBase]: 64/291 cut-off events. [2025-03-17 14:17:05,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:05,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 291 events. 64/291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1213 event pairs, 63 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 460. Up to 163 conditions per place. [2025-03-17 14:17:05,338 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 37 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-03-17 14:17:05,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 272 flow [2025-03-17 14:17:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:17:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:17:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-03-17 14:17:05,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6401869158878505 [2025-03-17 14:17:05,340 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 172 flow. Second operand 4 states and 274 transitions. [2025-03-17 14:17:05,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 272 flow [2025-03-17 14:17:05,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:05,345 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 219 flow [2025-03-17 14:17:05,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-17 14:17:05,347 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -17 predicate places. [2025-03-17 14:17:05,347 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 219 flow [2025-03-17 14:17:05,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:05,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:05,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:05,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:17:05,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:05,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -723463516, now seen corresponding path program 1 times [2025-03-17 14:17:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:05,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645916873] [2025-03-17 14:17:05,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:05,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:17:05,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:17:05,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:05,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:05,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645916873] [2025-03-17 14:17:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645916873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759596795] [2025-03-17 14:17:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:05,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:05,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 107 [2025-03-17 14:17:05,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:05,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 107 [2025-03-17 14:17:05,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:06,039 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-03-17 14:17:06,039 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:17:06,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 285 events. 64/285 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1176 event pairs, 63 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 482. Up to 154 conditions per place. [2025-03-17 14:17:06,041 INFO L140 encePairwiseOnDemand]: 90/107 looper letters, 30 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2025-03-17 14:17:06,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 85 transitions, 307 flow [2025-03-17 14:17:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 463 transitions. [2025-03-17 14:17:06,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408878504672897 [2025-03-17 14:17:06,046 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 219 flow. Second operand 8 states and 463 transitions. [2025-03-17 14:17:06,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 85 transitions, 307 flow [2025-03-17 14:17:06,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:06,048 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 245 flow [2025-03-17 14:17:06,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2025-03-17 14:17:06,048 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-03-17 14:17:06,048 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 245 flow [2025-03-17 14:17:06,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:06,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:06,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:06,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:17:06,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:06,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash -723463515, now seen corresponding path program 1 times [2025-03-17 14:17:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:06,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135725427] [2025-03-17 14:17:06,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:06,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:17:06,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:17:06,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:06,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:06,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135725427] [2025-03-17 14:17:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135725427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:06,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693431063] [2025-03-17 14:17:06,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:06,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:06,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:06,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 107 [2025-03-17 14:17:06,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:06,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:06,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 107 [2025-03-17 14:17:06,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:06,995 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2025-03-17 14:17:06,995 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 14:17:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 281 events. 64/281 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1180 event pairs, 63 based on Foata normal form. 2/234 useless extension candidates. Maximal degree in co-relation 494. Up to 158 conditions per place. [2025-03-17 14:17:06,997 INFO L140 encePairwiseOnDemand]: 95/107 looper letters, 32 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2025-03-17 14:17:06,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 335 flow [2025-03-17 14:17:06,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:17:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:17:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 373 transitions. [2025-03-17 14:17:06,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4979973297730307 [2025-03-17 14:17:06,998 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 245 flow. Second operand 7 states and 373 transitions. [2025-03-17 14:17:06,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 335 flow [2025-03-17 14:17:06,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 299 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 14:17:07,000 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 235 flow [2025-03-17 14:17:07,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-03-17 14:17:07,000 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -18 predicate places. [2025-03-17 14:17:07,000 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 235 flow [2025-03-17 14:17:07,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:07,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:07,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:07,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:17:07,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 536284947, now seen corresponding path program 1 times [2025-03-17 14:17:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43525692] [2025-03-17 14:17:07,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:07,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:17:07,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:17:07,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:07,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:07,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43525692] [2025-03-17 14:17:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43525692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788413305] [2025-03-17 14:17:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:07,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:07,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:07,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:07,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:07,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 107 [2025-03-17 14:17:07,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:07,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:07,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 107 [2025-03-17 14:17:07,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:07,361 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-03-17 14:17:07,361 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:17:07,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 279 events. 64/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1172 event pairs, 63 based on Foata normal form. 2/231 useless extension candidates. Maximal degree in co-relation 487. Up to 158 conditions per place. [2025-03-17 14:17:07,362 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 30 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-03-17 14:17:07,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 323 flow [2025-03-17 14:17:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 331 transitions. [2025-03-17 14:17:07,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186915887850467 [2025-03-17 14:17:07,368 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 235 flow. Second operand 5 states and 331 transitions. [2025-03-17 14:17:07,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 323 flow [2025-03-17 14:17:07,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 293 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:17:07,369 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 233 flow [2025-03-17 14:17:07,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-03-17 14:17:07,370 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-03-17 14:17:07,370 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 233 flow [2025-03-17 14:17:07,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:07,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:07,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:07,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:17:07,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:07,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash 536284948, now seen corresponding path program 1 times [2025-03-17 14:17:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:07,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029142938] [2025-03-17 14:17:07,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:07,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:07,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:17:07,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:17:07,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:07,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029142938] [2025-03-17 14:17:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029142938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:07,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4571655] [2025-03-17 14:17:07,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:07,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:07,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:07,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:07,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-03-17 14:17:07,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:07,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:07,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-03-17 14:17:07,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:07,791 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-03-17 14:17:07,791 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-17 14:17:07,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 277 events. 64/277 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1161 event pairs, 63 based on Foata normal form. 2/229 useless extension candidates. Maximal degree in co-relation 479. Up to 158 conditions per place. [2025-03-17 14:17:07,792 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 26 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2025-03-17 14:17:07,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 313 flow [2025-03-17 14:17:07,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2025-03-17 14:17:07,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6485981308411215 [2025-03-17 14:17:07,795 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 233 flow. Second operand 5 states and 347 transitions. [2025-03-17 14:17:07,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 313 flow [2025-03-17 14:17:07,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 283 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:07,796 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 231 flow [2025-03-17 14:17:07,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-03-17 14:17:07,799 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -22 predicate places. [2025-03-17 14:17:07,799 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 231 flow [2025-03-17 14:17:07,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:07,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:07,799 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:07,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:17:07,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:07,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 571428119, now seen corresponding path program 1 times [2025-03-17 14:17:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128843650] [2025-03-17 14:17:07,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:07,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:07,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:07,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:07,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:08,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128843650] [2025-03-17 14:17:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128843650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:08,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876159347] [2025-03-17 14:17:08,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:08,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:08,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:08,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:17:08,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:08,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:08,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:08,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 14:17:08,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:08,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:08,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:08,324 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:17:08,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 14:17:08,355 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:08,355 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:17:08,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:08,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:08,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:08,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:08,709 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 43 treesize of output 61 [2025-03-17 14:17:08,757 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:08,758 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876159347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:08,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 16 [2025-03-17 14:17:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251249912] [2025-03-17 14:17:08,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:08,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 14:17:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:08,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 14:17:08,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:17:10,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 107 [2025-03-17 14:17:10,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 231 flow. Second operand has 18 states, 18 states have (on average 57.833333333333336) internal successors, (1041), 18 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:10,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:10,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 107 [2025-03-17 14:17:10,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:11,122 INFO L124 PetriNetUnfolderBase]: 75/332 cut-off events. [2025-03-17 14:17:11,123 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 14:17:11,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 332 events. 75/332 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1442 event pairs, 72 based on Foata normal form. 6/281 useless extension candidates. Maximal degree in co-relation 602. Up to 178 conditions per place. [2025-03-17 14:17:11,125 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 46 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2025-03-17 14:17:11,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 101 transitions, 459 flow [2025-03-17 14:17:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:17:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:17:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 573 transitions. [2025-03-17 14:17:11,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5950155763239875 [2025-03-17 14:17:11,126 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 231 flow. Second operand 9 states and 573 transitions. [2025-03-17 14:17:11,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 101 transitions, 459 flow [2025-03-17 14:17:11,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 101 transitions, 393 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:11,130 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 305 flow [2025-03-17 14:17:11,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=305, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2025-03-17 14:17:11,131 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -14 predicate places. [2025-03-17 14:17:11,132 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 305 flow [2025-03-17 14:17:11,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 57.833333333333336) internal successors, (1041), 18 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:11,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:11,132 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:17:11,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:17:11,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:11,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:11,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1112707227, now seen corresponding path program 1 times [2025-03-17 14:17:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:11,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911165598] [2025-03-17 14:17:11,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:11,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:17:11,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:17:11,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:11,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:11,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:11,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911165598] [2025-03-17 14:17:11,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911165598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:11,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195322930] [2025-03-17 14:17:11,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:11,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:11,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:11,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:17:11,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:17:11,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:17:11,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:11,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:11,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:17:11,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:11,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195322930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:11,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:11,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:17:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711843157] [2025-03-17 14:17:11,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:11,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:17:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:11,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:17:11,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:17:11,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-03-17 14:17:11,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 305 flow. Second operand has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:11,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:11,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-03-17 14:17:11,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:11,846 INFO L124 PetriNetUnfolderBase]: 64/318 cut-off events. [2025-03-17 14:17:11,846 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-17 14:17:11,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 318 events. 64/318 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1131 event pairs, 63 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 603. Up to 154 conditions per place. [2025-03-17 14:17:11,847 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 62 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2025-03-17 14:17:11,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 111 transitions, 541 flow [2025-03-17 14:17:11,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 658 transitions. [2025-03-17 14:17:11,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7686915887850467 [2025-03-17 14:17:11,849 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 305 flow. Second operand 8 states and 658 transitions. [2025-03-17 14:17:11,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 111 transitions, 541 flow [2025-03-17 14:17:11,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 111 transitions, 521 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:11,852 INFO L231 Difference]: Finished difference. Result has 103 places, 90 transitions, 321 flow [2025-03-17 14:17:11,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=103, PETRI_TRANSITIONS=90} [2025-03-17 14:17:11,853 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -6 predicate places. [2025-03-17 14:17:11,853 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 90 transitions, 321 flow [2025-03-17 14:17:11,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:11,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:11,853 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 14:17:11,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:12,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:17:12,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:12,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 917202246, now seen corresponding path program 2 times [2025-03-17 14:17:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:12,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875546131] [2025-03-17 14:17:12,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:12,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:12,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 14:17:12,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:17:12,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:17:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875546131] [2025-03-17 14:17:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875546131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141392385] [2025-03-17 14:17:13,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:13,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:13,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:13,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:17:13,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 14:17:13,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:17:13,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:17:13,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:13,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-17 14:17:13,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:13,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:13,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:13,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:13,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:13,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:13,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:13,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:13,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:13,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:13,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:14,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:14,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:14,114 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:17:14,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 14:17:14,128 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:14,128 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:17:14,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:14,206 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:17:14,214 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:17:14,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:14,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 12 treesize of output 4 [2025-03-17 14:17:14,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:14,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:17:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:14,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:14,577 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:14,578 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:14,646 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:14,647 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:14,814 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:14,814 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:14,889 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:14,889 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:15,030 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:15,030 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:15,109 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:15,109 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:15,248 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:15,248 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:15,331 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:15,331 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141392385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:15,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 47 [2025-03-17 14:17:15,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357819582] [2025-03-17 14:17:15,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:15,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 14:17:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:15,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 14:17:15,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 14:17:21,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 107 [2025-03-17 14:17:21,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 90 transitions, 321 flow. Second operand has 49 states, 49 states have (on average 57.95918367346939) internal successors, (2840), 49 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:21,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:21,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 107 [2025-03-17 14:17:21,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:23,342 INFO L124 PetriNetUnfolderBase]: 77/394 cut-off events. [2025-03-17 14:17:23,342 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-03-17 14:17:23,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 394 events. 77/394 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1536 event pairs, 72 based on Foata normal form. 6/346 useless extension candidates. Maximal degree in co-relation 821. Up to 180 conditions per place. [2025-03-17 14:17:23,344 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 70 selfloop transitions, 36 changer transitions 0/145 dead transitions. [2025-03-17 14:17:23,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 145 transitions, 867 flow [2025-03-17 14:17:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 14:17:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-17 14:17:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1736 transitions. [2025-03-17 14:17:23,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.559458588462778 [2025-03-17 14:17:23,348 INFO L175 Difference]: Start difference. First operand has 103 places, 90 transitions, 321 flow. Second operand 29 states and 1736 transitions. [2025-03-17 14:17:23,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 145 transitions, 867 flow [2025-03-17 14:17:23,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 145 transitions, 851 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-17 14:17:23,351 INFO L231 Difference]: Finished difference. Result has 140 places, 110 transitions, 629 flow [2025-03-17 14:17:23,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=629, PETRI_PLACES=140, PETRI_TRANSITIONS=110} [2025-03-17 14:17:23,353 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 31 predicate places. [2025-03-17 14:17:23,353 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 110 transitions, 629 flow [2025-03-17 14:17:23,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 57.95918367346939) internal successors, (2840), 49 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:23,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:23,354 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-17 14:17:23,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:23,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:23,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1839802543, now seen corresponding path program 2 times [2025-03-17 14:17:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664652488] [2025-03-17 14:17:23,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:23,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-17 14:17:23,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:17:23,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:17:23,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-17 14:17:23,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:23,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664652488] [2025-03-17 14:17:23,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664652488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:23,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957456627] [2025-03-17 14:17:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:23,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:23,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:23,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:24,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 107 [2025-03-17 14:17:24,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 110 transitions, 629 flow. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:24,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:24,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 107 [2025-03-17 14:17:24,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:24,359 INFO L124 PetriNetUnfolderBase]: 116/562 cut-off events. [2025-03-17 14:17:24,359 INFO L125 PetriNetUnfolderBase]: For 585/585 co-relation queries the response was YES. [2025-03-17 14:17:24,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 562 events. 116/562 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2924 event pairs, 36 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 1170. Up to 161 conditions per place. [2025-03-17 14:17:24,362 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 59 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2025-03-17 14:17:24,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 123 transitions, 825 flow [2025-03-17 14:17:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:17:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:17:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2025-03-17 14:17:24,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822429906542056 [2025-03-17 14:17:24,364 INFO L175 Difference]: Start difference. First operand has 140 places, 110 transitions, 629 flow. Second operand 6 states and 438 transitions. [2025-03-17 14:17:24,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 123 transitions, 825 flow [2025-03-17 14:17:24,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 123 transitions, 701 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-03-17 14:17:24,368 INFO L231 Difference]: Finished difference. Result has 134 places, 111 transitions, 572 flow [2025-03-17 14:17:24,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=134, PETRI_TRANSITIONS=111} [2025-03-17 14:17:24,368 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 25 predicate places. [2025-03-17 14:17:24,369 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 111 transitions, 572 flow [2025-03-17 14:17:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:24,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:24,369 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:24,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:17:24,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:24,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1199304645, now seen corresponding path program 1 times [2025-03-17 14:17:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645335085] [2025-03-17 14:17:24,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:24,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 14:17:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 14:17:24,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:24,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:24,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645335085] [2025-03-17 14:17:24,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645335085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:24,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629370989] [2025-03-17 14:17:24,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:24,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:24,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:24,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:17:24,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 14:17:24,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 14:17:24,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:24,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:24,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:17:24,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:24,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:25,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629370989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:25,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:25,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-17 14:17:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999753120] [2025-03-17 14:17:25,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:25,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:17:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:25,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:17:25,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:17:25,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-03-17 14:17:25,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 111 transitions, 572 flow. Second operand has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:25,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:25,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-03-17 14:17:25,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:25,280 INFO L124 PetriNetUnfolderBase]: 95/481 cut-off events. [2025-03-17 14:17:25,280 INFO L125 PetriNetUnfolderBase]: For 491/492 co-relation queries the response was YES. [2025-03-17 14:17:25,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 481 events. 95/481 cut-off events. For 491/492 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2049 event pairs, 87 based on Foata normal form. 4/410 useless extension candidates. Maximal degree in co-relation 1031. Up to 220 conditions per place. [2025-03-17 14:17:25,283 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 89 selfloop transitions, 12 changer transitions 0/141 dead transitions. [2025-03-17 14:17:25,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 926 flow [2025-03-17 14:17:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:17:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:17:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 978 transitions. [2025-03-17 14:17:25,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616822429906542 [2025-03-17 14:17:25,286 INFO L175 Difference]: Start difference. First operand has 134 places, 111 transitions, 572 flow. Second operand 12 states and 978 transitions. [2025-03-17 14:17:25,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 926 flow [2025-03-17 14:17:25,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 141 transitions, 890 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-17 14:17:25,291 INFO L231 Difference]: Finished difference. Result has 143 places, 108 transitions, 516 flow [2025-03-17 14:17:25,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=516, PETRI_PLACES=143, PETRI_TRANSITIONS=108} [2025-03-17 14:17:25,292 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 34 predicate places. [2025-03-17 14:17:25,292 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 108 transitions, 516 flow [2025-03-17 14:17:25,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:25,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:25,293 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-03-17 14:17:25,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:25,493 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-17 14:17:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash 554356964, now seen corresponding path program 3 times [2025-03-17 14:17:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883228902] [2025-03-17 14:17:25,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:17:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:25,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-03-17 14:17:25,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 14:17:25,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:17:25,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 409 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883228902] [2025-03-17 14:17:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883228902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129765895] [2025-03-17 14:17:26,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:17:26,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:26,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:26,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:17:26,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes.