./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.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 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:00:37,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:37,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:00:37,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:37,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:37,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:37,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:37,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:37,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:37,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:37,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:37,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:37,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:37,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:37,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:37,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:37,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:37,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:37,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:37,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:37,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:37,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:37,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:37,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:37,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:37,972 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 -> 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c [2025-03-04 10:00:38,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:38,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:38,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:38,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:38,224 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:38,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-03-04 10:00:39,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9dc26e9/b88a5988756f4c7da4c969ec6075045b/FLAG80dcfc2f3 [2025-03-04 10:00:39,707 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:39,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-03-04 10:00:39,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9dc26e9/b88a5988756f4c7da4c969ec6075045b/FLAG80dcfc2f3 [2025-03-04 10:00:39,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9dc26e9/b88a5988756f4c7da4c969ec6075045b [2025-03-04 10:00:39,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:39,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:39,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:39,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:39,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:39,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:39" (1/1) ... [2025-03-04 10:00:39,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240cfa00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:39, skipping insertion in model container [2025-03-04 10:00:39,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:39" (1/1) ... [2025-03-04 10:00:40,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:40,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:40,397 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:40,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:40,513 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:40,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40 WrapperNode [2025-03-04 10:00:40,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:40,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:40,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:40,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:40,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,553 INFO L138 Inliner]: procedures = 372, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 215 [2025-03-04 10:00:40,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:40,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:40,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:40,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:40,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,589 INFO L175 MemorySlicer]: Split 88 memory accesses to 3 slices as follows [50, 16, 22]. 57 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 17 writes are split as follows [0, 1, 16]. [2025-03-04 10:00:40,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:40,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:40,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:40,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:40,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (1/1) ... [2025-03-04 10:00:40,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:40,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:40,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:00:40,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:00:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:00:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:00:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:00:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:00:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:00:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:00:40,653 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:00:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:40,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:40,654 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:00:40,791 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:40,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:41,249 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:41,250 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:41,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:41,503 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:41,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:41 BoogieIcfgContainer [2025-03-04 10:00:41,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:41,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:41,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:41,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:41,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:39" (1/3) ... [2025-03-04 10:00:41,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701a78c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:41, skipping insertion in model container [2025-03-04 10:00:41,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:40" (2/3) ... [2025-03-04 10:00:41,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701a78c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:41, skipping insertion in model container [2025-03-04 10:00:41,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:41" (3/3) ... [2025-03-04 10:00:41,512 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.i [2025-03-04 10:00:41,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:41,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 57 error locations. [2025-03-04 10:00:41,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:41,579 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 10:00:41,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 206 flow [2025-03-04 10:00:41,646 INFO L124 PetriNetUnfolderBase]: 1/100 cut-off events. [2025-03-04 10:00:41,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:41,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 100 events. 1/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 329 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2025-03-04 10:00:41,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 101 transitions, 206 flow [2025-03-04 10:00:41,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 100 transitions, 203 flow [2025-03-04 10:00:41,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:41,675 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;@26f0c711, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:41,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-04 10:00:41,681 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:41,681 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 10:00:41,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:41,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:41,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:41,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:41,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash 656657, now seen corresponding path program 1 times [2025-03-04 10:00:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:41,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362201790] [2025-03-04 10:00:41,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:41,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:41,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:41,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362201790] [2025-03-04 10:00:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362201790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:41,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:41,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786774511] [2025-03-04 10:00:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:41,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:41,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:41,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:41,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:42,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 101 [2025-03-04 10:00:42,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:42,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:42,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 101 [2025-03-04 10:00:42,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:42,226 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-03-04 10:00:42,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:42,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 289 events. 64/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1329 event pairs, 63 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 376. Up to 157 conditions per place. [2025-03-04 10:00:42,232 INFO L140 encePairwiseOnDemand]: 89/101 looper letters, 30 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2025-03-04 10:00:42,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 263 flow [2025-03-04 10:00:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2025-03-04 10:00:42,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7227722772277227 [2025-03-04 10:00:42,244 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 203 flow. Second operand 3 states and 219 transitions. [2025-03-04 10:00:42,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 263 flow [2025-03-04 10:00:42,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:42,251 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 202 flow [2025-03-04 10:00:42,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2025-03-04 10:00:42,256 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -5 predicate places. [2025-03-04 10:00:42,258 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 202 flow [2025-03-04 10:00:42,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:42,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:42,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:42,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:42,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:42,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash 656658, now seen corresponding path program 1 times [2025-03-04 10:00:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025514980] [2025-03-04 10:00:42,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:42,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:42,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:42,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:42,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:42,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025514980] [2025-03-04 10:00:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025514980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:42,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:42,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609484141] [2025-03-04 10:00:42,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:42,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:42,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:42,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:42,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 101 [2025-03-04 10:00:42,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:42,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:42,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 101 [2025-03-04 10:00:42,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:42,622 INFO L124 PetriNetUnfolderBase]: 64/283 cut-off events. [2025-03-04 10:00:42,622 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:00:42,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 283 events. 64/283 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1294 event pairs, 63 based on Foata normal form. 6/222 useless extension candidates. Maximal degree in co-relation 410. Up to 157 conditions per place. [2025-03-04 10:00:42,624 INFO L140 encePairwiseOnDemand]: 89/101 looper letters, 27 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-03-04 10:00:42,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 256 flow [2025-03-04 10:00:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2025-03-04 10:00:42,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7425742574257426 [2025-03-04 10:00:42,628 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 202 flow. Second operand 3 states and 225 transitions. [2025-03-04 10:00:42,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 256 flow [2025-03-04 10:00:42,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:42,632 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 190 flow [2025-03-04 10:00:42,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-03-04 10:00:42,633 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -11 predicate places. [2025-03-04 10:00:42,633 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 190 flow [2025-03-04 10:00:42,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:42,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:42,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:00:42,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:00:42,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:42,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 631065403, now seen corresponding path program 1 times [2025-03-04 10:00:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357484504] [2025-03-04 10:00:42,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:42,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:00:42,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:00:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:42,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:42,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357484504] [2025-03-04 10:00:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357484504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:42,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:42,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974598804] [2025-03-04 10:00:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:42,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:42,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:42,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:43,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 101 [2025-03-04 10:00:43,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:43,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:43,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 101 [2025-03-04 10:00:43,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:43,164 INFO L124 PetriNetUnfolderBase]: 73/303 cut-off events. [2025-03-04 10:00:43,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:43,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 303 events. 73/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1405 event pairs, 72 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 451. Up to 181 conditions per place. [2025-03-04 10:00:43,167 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 36 selfloop transitions, 1 changer transitions 0/82 dead transitions. [2025-03-04 10:00:43,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 252 flow [2025-03-04 10:00:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-03-04 10:00:43,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7161716171617162 [2025-03-04 10:00:43,171 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 190 flow. Second operand 3 states and 217 transitions. [2025-03-04 10:00:43,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 252 flow [2025-03-04 10:00:43,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:43,173 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 168 flow [2025-03-04 10:00:43,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2025-03-04 10:00:43,173 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -17 predicate places. [2025-03-04 10:00:43,173 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 168 flow [2025-03-04 10:00:43,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:43,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:43,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:00:43,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:00:43,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:43,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash 631065404, now seen corresponding path program 1 times [2025-03-04 10:00:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:43,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044151366] [2025-03-04 10:00:43,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:43,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:00:43,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:00:43,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:43,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044151366] [2025-03-04 10:00:43,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044151366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:43,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:43,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131292396] [2025-03-04 10:00:43,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:43,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:43,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:43,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:43,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 101 [2025-03-04 10:00:43,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:43,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:43,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 101 [2025-03-04 10:00:43,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:43,743 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-03-04 10:00:43,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:43,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 289 events. 64/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1237 event pairs, 63 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 457. Up to 162 conditions per place. [2025-03-04 10:00:43,745 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 36 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-04 10:00:43,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 266 flow [2025-03-04 10:00:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-03-04 10:00:43,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6460396039603961 [2025-03-04 10:00:43,747 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 168 flow. Second operand 4 states and 261 transitions. [2025-03-04 10:00:43,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 266 flow [2025-03-04 10:00:43,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:43,751 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 215 flow [2025-03-04 10:00:43,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-03-04 10:00:43,752 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -13 predicate places. [2025-03-04 10:00:43,755 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 215 flow [2025-03-04 10:00:43,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:43,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:43,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:43,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:00:43,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:43,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 880873392, now seen corresponding path program 1 times [2025-03-04 10:00:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:43,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189042178] [2025-03-04 10:00:43,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:43,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:43,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:43,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:43,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189042178] [2025-03-04 10:00:43,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189042178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:43,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:43,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:00:43,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154598264] [2025-03-04 10:00:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:43,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:43,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:43,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:43,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:44,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 101 [2025-03-04 10:00:44,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:44,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:44,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 101 [2025-03-04 10:00:44,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:44,451 INFO L124 PetriNetUnfolderBase]: 64/283 cut-off events. [2025-03-04 10:00:44,451 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:00:44,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 283 events. 64/283 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1198 event pairs, 63 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 478. Up to 154 conditions per place. [2025-03-04 10:00:44,455 INFO L140 encePairwiseOnDemand]: 85/101 looper letters, 29 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2025-03-04 10:00:44,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 83 transitions, 299 flow [2025-03-04 10:00:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:00:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:00:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 445 transitions. [2025-03-04 10:00:44,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5507425742574258 [2025-03-04 10:00:44,459 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 215 flow. Second operand 8 states and 445 transitions. [2025-03-04 10:00:44,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 83 transitions, 299 flow [2025-03-04 10:00:44,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:44,461 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 239 flow [2025-03-04 10:00:44,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=239, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-03-04 10:00:44,461 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -11 predicate places. [2025-03-04 10:00:44,461 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 239 flow [2025-03-04 10:00:44,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:44,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:44,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:44,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:00:44,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:44,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash 880873393, now seen corresponding path program 1 times [2025-03-04 10:00:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:44,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331546529] [2025-03-04 10:00:44,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:44,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:44,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:44,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:44,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:44,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331546529] [2025-03-04 10:00:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331546529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:44,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:44,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:00:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094348688] [2025-03-04 10:00:44,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:44,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:44,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:45,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 101 [2025-03-04 10:00:45,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 239 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-04 10:00:45,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:45,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 101 [2025-03-04 10:00:45,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:45,430 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-03-04 10:00:45,430 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 10:00:45,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 279 events. 64/279 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1198 event pairs, 63 based on Foata normal form. 2/232 useless extension candidates. Maximal degree in co-relation 489. Up to 158 conditions per place. [2025-03-04 10:00:45,431 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 32 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2025-03-04 10:00:45,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 81 transitions, 325 flow [2025-03-04 10:00:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:00:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:00:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2025-03-04 10:00:45,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5247524752475248 [2025-03-04 10:00:45,434 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 239 flow. Second operand 7 states and 371 transitions. [2025-03-04 10:00:45,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 81 transitions, 325 flow [2025-03-04 10:00:45,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 291 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:00:45,435 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 227 flow [2025-03-04 10:00:45,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2025-03-04 10:00:45,436 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -14 predicate places. [2025-03-04 10:00:45,436 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 227 flow [2025-03-04 10:00:45,436 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-04 10:00:45,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:45,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:00:45,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash 410793705, now seen corresponding path program 1 times [2025-03-04 10:00:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709600934] [2025-03-04 10:00:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:45,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:00:45,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:00:45,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:45,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709600934] [2025-03-04 10:00:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709600934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94289511] [2025-03-04 10:00:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:45,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:45,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:45,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:45,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 101 [2025-03-04 10:00:45,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:45,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:45,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 101 [2025-03-04 10:00:45,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:45,748 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-03-04 10:00:45,748 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:00:45,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 277 events. 64/277 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1181 event pairs, 63 based on Foata normal form. 2/228 useless extension candidates. Maximal degree in co-relation 481. Up to 158 conditions per place. [2025-03-04 10:00:45,749 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 30 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2025-03-04 10:00:45,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 80 transitions, 311 flow [2025-03-04 10:00:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 319 transitions. [2025-03-04 10:00:45,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6316831683168317 [2025-03-04 10:00:45,752 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 227 flow. Second operand 5 states and 319 transitions. [2025-03-04 10:00:45,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 80 transitions, 311 flow [2025-03-04 10:00:45,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 285 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:00:45,753 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 225 flow [2025-03-04 10:00:45,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2025-03-04 10:00:45,754 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -17 predicate places. [2025-03-04 10:00:45,754 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 225 flow [2025-03-04 10:00:45,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:45,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:45,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:45,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:00:45,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:45,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash 410793706, now seen corresponding path program 1 times [2025-03-04 10:00:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142035939] [2025-03-04 10:00:45,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:45,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:00:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:00:45,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:45,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142035939] [2025-03-04 10:00:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142035939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321855706] [2025-03-04 10:00:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:45,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:45,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:45,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:46,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 101 [2025-03-04 10:00:46,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:46,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:46,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 101 [2025-03-04 10:00:46,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:46,169 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2025-03-04 10:00:46,169 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 10:00:46,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 275 events. 64/275 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1169 event pairs, 63 based on Foata normal form. 2/226 useless extension candidates. Maximal degree in co-relation 474. Up to 158 conditions per place. [2025-03-04 10:00:46,170 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 27 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2025-03-04 10:00:46,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 79 transitions, 303 flow [2025-03-04 10:00:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 331 transitions. [2025-03-04 10:00:46,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6554455445544555 [2025-03-04 10:00:46,172 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 225 flow. Second operand 5 states and 331 transitions. [2025-03-04 10:00:46,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 79 transitions, 303 flow [2025-03-04 10:00:46,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 79 transitions, 277 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:46,173 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 223 flow [2025-03-04 10:00:46,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-04 10:00:46,174 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -18 predicate places. [2025-03-04 10:00:46,174 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 223 flow [2025-03-04 10:00:46,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:46,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:46,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:46,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:00:46,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:46,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2124216690, now seen corresponding path program 1 times [2025-03-04 10:00:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:46,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267654333] [2025-03-04 10:00:46,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:00:46,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:00:46,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:46,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:46,441 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-04 10:00:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267654333] [2025-03-04 10:00:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267654333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976777479] [2025-03-04 10:00:46,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:46,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:46,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:46,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:46,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:00:46,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:00:46,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:00:46,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:46,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:46,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:00:46,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:46,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:46,613 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-04 10:00:46,662 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:00:46,663 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-04 10:00:46,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:46,686 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-04 10:00:46,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:46,803 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-04 10:00:46,832 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-04 10:00:46,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:47,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:47,020 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-04 10:00:47,099 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:47,100 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-04 10:00:47,155 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-04 10:00:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976777479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:47,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:47,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 16 [2025-03-04 10:00:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639822044] [2025-03-04 10:00:47,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:47,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:00:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:47,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:00:47,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:00:48,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 101 [2025-03-04 10:00:48,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 223 flow. Second operand has 18 states, 18 states have (on average 54.833333333333336) internal successors, (987), 18 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:48,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:48,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 101 [2025-03-04 10:00:48,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:49,225 INFO L124 PetriNetUnfolderBase]: 75/330 cut-off events. [2025-03-04 10:00:49,225 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 10:00:49,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 330 events. 75/330 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1473 event pairs, 72 based on Foata normal form. 6/279 useless extension candidates. Maximal degree in co-relation 597. Up to 177 conditions per place. [2025-03-04 10:00:49,227 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 45 selfloop transitions, 16 changer transitions 0/99 dead transitions. [2025-03-04 10:00:49,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 99 transitions, 449 flow [2025-03-04 10:00:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:00:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:00:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 545 transitions. [2025-03-04 10:00:49,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5995599559955995 [2025-03-04 10:00:49,229 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 223 flow. Second operand 9 states and 545 transitions. [2025-03-04 10:00:49,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 99 transitions, 449 flow [2025-03-04 10:00:49,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 99 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:49,231 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 301 flow [2025-03-04 10:00:49,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=301, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2025-03-04 10:00:49,232 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -10 predicate places. [2025-03-04 10:00:49,232 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 301 flow [2025-03-04 10:00:49,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 54.833333333333336) internal successors, (987), 18 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:49,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:49,232 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:00:49,239 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-04 10:00:49,433 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-04 10:00:49,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:49,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1790823150, now seen corresponding path program 1 times [2025-03-04 10:00:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038041257] [2025-03-04 10:00:49,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:49,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:00:49,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:00:49,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:49,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:49,605 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-04 10:00:49,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038041257] [2025-03-04 10:00:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038041257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388343115] [2025-03-04 10:00:49,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:49,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:49,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:49,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:00:49,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:00:49,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:00:49,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:49,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:49,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:00:49,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:49,768 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-04 10:00:49,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:49,803 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-04 10:00:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388343115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:49,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:00:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770464850] [2025-03-04 10:00:49,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:49,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:00:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:49,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:00:49,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:00:49,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 101 [2025-03-04 10:00:49,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 301 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:49,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:49,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 101 [2025-03-04 10:00:49,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:49,949 INFO L124 PetriNetUnfolderBase]: 64/316 cut-off events. [2025-03-04 10:00:49,950 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-04 10:00:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 316 events. 64/316 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1132 event pairs, 63 based on Foata normal form. 4/270 useless extension candidates. Maximal degree in co-relation 600. Up to 153 conditions per place. [2025-03-04 10:00:49,951 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 61 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2025-03-04 10:00:49,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 535 flow [2025-03-04 10:00:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:00:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:00:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 617 transitions. [2025-03-04 10:00:49,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7636138613861386 [2025-03-04 10:00:49,953 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 301 flow. Second operand 8 states and 617 transitions. [2025-03-04 10:00:49,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 535 flow [2025-03-04 10:00:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 109 transitions, 515 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:49,957 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 317 flow [2025-03-04 10:00:49,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2025-03-04 10:00:49,958 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -2 predicate places. [2025-03-04 10:00:49,959 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 317 flow [2025-03-04 10:00:49,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:49,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:49,960 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-04 10:00:49,967 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-04 10:00:50,160 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-04 10:00:50,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:00:50,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -399392380, now seen corresponding path program 2 times [2025-03-04 10:00:50,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:50,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978370649] [2025-03-04 10:00:50,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:50,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:50,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 10:00:50,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:00:50,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:50,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:51,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:51,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978370649] [2025-03-04 10:00:51,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978370649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:51,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091626007] [2025-03-04 10:00:51,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:51,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:51,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:51,453 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-04 10:00:51,455 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-04 10:00:51,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 10:00:51,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:00:51,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:51,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:51,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-04 10:00:51,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:51,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:51,705 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-04 10:00:51,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:51,744 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-04 10:00:51,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:51,811 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-04 10:00:51,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:51,849 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-04 10:00:51,923 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:00:51,923 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-04 10:00:51,936 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:51,936 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-04 10:00:51,992 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:51,992 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-04 10:00:51,996 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-04 10:00:52,003 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 15 treesize of output 1 [2025-03-04 10:00:52,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:52,166 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-04 10:00:52,184 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-04 10:00:52,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:52,250 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-04 10:00:52,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 10:00:52,260 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-04 10:00:52,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:52,408 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-04 10:00:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:52,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:52,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:52,626 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-04 10:00:52,678 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:52,678 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-04 10:00:52,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:52,839 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-04 10:00:52,898 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:52,898 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-04 10:00:53,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:53,054 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-04 10:00:53,127 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:53,127 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-04 10:00:53,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:53,311 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-04 10:00:53,387 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:53,388 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-04 10:00:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091626007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:53,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 10] total 45 [2025-03-04 10:00:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189943504] [2025-03-04 10:00:53,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:53,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 10:00:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:53,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 10:00:53,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1809, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 10:01:03,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 101 [2025-03-04 10:01:03,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 317 flow. Second operand has 47 states, 47 states have (on average 55.04255319148936) internal successors, (2587), 47 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:01:03,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:03,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 101 [2025-03-04 10:01:03,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:05,050 INFO L124 PetriNetUnfolderBase]: 77/392 cut-off events. [2025-03-04 10:01:05,051 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-03-04 10:01:05,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 392 events. 77/392 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1517 event pairs, 72 based on Foata normal form. 6/344 useless extension candidates. Maximal degree in co-relation 818. Up to 179 conditions per place. [2025-03-04 10:01:05,052 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 77 selfloop transitions, 28 changer transitions 0/143 dead transitions. [2025-03-04 10:01:05,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 143 transitions, 861 flow [2025-03-04 10:01:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:01:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:01:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1224 transitions. [2025-03-04 10:01:05,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5770862800565771 [2025-03-04 10:01:05,055 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 317 flow. Second operand 21 states and 1224 transitions. [2025-03-04 10:01:05,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 143 transitions, 861 flow [2025-03-04 10:01:05,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 143 transitions, 845 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 10:01:05,058 INFO L231 Difference]: Finished difference. Result has 131 places, 104 transitions, 573 flow [2025-03-04 10:01:05,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=573, PETRI_PLACES=131, PETRI_TRANSITIONS=104} [2025-03-04 10:01:05,058 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 28 predicate places. [2025-03-04 10:01:05,059 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 104 transitions, 573 flow [2025-03-04 10:01:05,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 55.04255319148936) internal successors, (2587), 47 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:01:05,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:05,060 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-04 10:01:05,067 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-04 10:01:05,260 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-04 10:01:05,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:01:05,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash 662719798, now seen corresponding path program 2 times [2025-03-04 10:01:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477587970] [2025-03-04 10:01:05,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:01:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:05,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 10:01:05,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:01:05,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:01:05,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:05,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:05,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477587970] [2025-03-04 10:01:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477587970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:05,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461725065] [2025-03-04 10:01:05,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:01:05,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:05,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:05,576 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-04 10:01:05,578 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-04 10:01:05,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 10:01:05,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:01:05,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:01:05,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:05,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:01:05,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:05,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461725065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:01:06,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:01:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-04 10:01:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253100161] [2025-03-04 10:01:06,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:01:06,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:01:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:06,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:01:06,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:01:06,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 101 [2025-03-04 10:01:06,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 104 transitions, 573 flow. Second operand has 13 states, 13 states have (on average 73.84615384615384) internal successors, (960), 13 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:01:06,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:06,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 101 [2025-03-04 10:01:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:06,229 INFO L124 PetriNetUnfolderBase]: 64/358 cut-off events. [2025-03-04 10:01:06,229 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-03-04 10:01:06,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 358 events. 64/358 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1130 event pairs, 63 based on Foata normal form. 4/312 useless extension candidates. Maximal degree in co-relation 816. Up to 153 conditions per place. [2025-03-04 10:01:06,230 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 86 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2025-03-04 10:01:06,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 943 flow [2025-03-04 10:01:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:01:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:01:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 917 transitions. [2025-03-04 10:01:06,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7566006600660066 [2025-03-04 10:01:06,232 INFO L175 Difference]: Start difference. First operand has 131 places, 104 transitions, 573 flow. Second operand 12 states and 917 transitions. [2025-03-04 10:01:06,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 943 flow [2025-03-04 10:01:06,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 138 transitions, 860 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-03-04 10:01:06,237 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 476 flow [2025-03-04 10:01:06,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=476, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2025-03-04 10:01:06,237 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 32 predicate places. [2025-03-04 10:01:06,237 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 476 flow [2025-03-04 10:01:06,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 73.84615384615384) internal successors, (960), 13 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:01:06,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:06,238 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-03-04 10:01:06,247 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-04 10:01:06,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:06,439 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-03-04 10:01:06,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:06,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1562599408, now seen corresponding path program 3 times [2025-03-04 10:01:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:06,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027327418] [2025-03-04 10:01:06,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:01:06,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:06,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-03-04 10:01:07,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:01:07,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:01:07,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:07,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:07,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027327418] [2025-03-04 10:01:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027327418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:07,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940732037] [2025-03-04 10:01:07,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:01:07,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:07,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:07,527 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-04 10:01:07,529 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-04 10:01:07,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes.