./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.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_13-arraycollapse_nr-deref.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 e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:00:41,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:41,072 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:41,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:41,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:41,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:41,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:41,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:41,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:41,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:41,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:41,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:41,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:41,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:41,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:41,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:41,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:41,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:41,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:41,105 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 -> e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 [2025-03-04 10:00:41,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:41,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:41,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:41,343 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:41,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:41,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-03-04 10:00:42,480 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1fd35f8/a087f5a14e7e4aaa807903a2286da877/FLAG5f7a7a844 [2025-03-04 10:00:42,775 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:42,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-03-04 10:00:42,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1fd35f8/a087f5a14e7e4aaa807903a2286da877/FLAG5f7a7a844 [2025-03-04 10:00:43,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1fd35f8/a087f5a14e7e4aaa807903a2286da877 [2025-03-04 10:00:43,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:43,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:43,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:43,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:43,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:43,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:43" (1/1) ... [2025-03-04 10:00:43,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27738ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:43, skipping insertion in model container [2025-03-04 10:00:43,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:43" (1/1) ... [2025-03-04 10:00:43,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:43,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:43,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:43,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:43,589 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:43,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:43 WrapperNode [2025-03-04 10:00:43,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:43,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:43,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:43,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:43,596 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:43" (1/1) ... [2025-03-04 10:00:43,614 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:43" (1/1) ... [2025-03-04 10:00:43,642 INFO L138 Inliner]: procedures = 372, calls = 100, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 257 [2025-03-04 10:00:43,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:43,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:43,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:43,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:43,655 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:43" (1/1) ... [2025-03-04 10:00:43,656 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:43" (1/1) ... [2025-03-04 10:00:43,659 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:43" (1/1) ... [2025-03-04 10:00:43,683 INFO L175 MemorySlicer]: Split 99 memory accesses to 3 slices as follows [50, 18, 31]. 51 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 26 writes are split as follows [0, 2, 24]. [2025-03-04 10:00:43,683 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:43" (1/1) ... [2025-03-04 10:00:43,683 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:43" (1/1) ... [2025-03-04 10:00:43,697 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:43" (1/1) ... [2025-03-04 10:00:43,699 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:43" (1/1) ... [2025-03-04 10:00:43,704 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:43" (1/1) ... [2025-03-04 10:00:43,707 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:43" (1/1) ... [2025-03-04 10:00:43,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:43,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:43,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:43,711 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:43,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:43" (1/1) ... [2025-03-04 10:00:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:43,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:43,756 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:43,759 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:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:00:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:00:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:00:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:00:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:00:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:00:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:00:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:00:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:00:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:00:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:00:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:00:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:00:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:00:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:00:43,780 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:00:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:00:43,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:43,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:43,782 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:43,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:43,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:44,511 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:44,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:44,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:44,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:44,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:44 BoogieIcfgContainer [2025-03-04 10:00:44,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:44,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:44,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:44,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:44,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:43" (1/3) ... [2025-03-04 10:00:44,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af2c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:44, skipping insertion in model container [2025-03-04 10:00:44,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:43" (2/3) ... [2025-03-04 10:00:44,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af2c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:44, skipping insertion in model container [2025-03-04 10:00:44,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:44" (3/3) ... [2025-03-04 10:00:44,792 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2025-03-04 10:00:44,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:44,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr-deref.i that has 2 procedures, 134 locations, 1 initial locations, 1 loop locations, and 79 error locations. [2025-03-04 10:00:44,808 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:44,864 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 10:00:44,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2025-03-04 10:00:44,970 INFO L124 PetriNetUnfolderBase]: 1/133 cut-off events. [2025-03-04 10:00:44,971 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:44,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 1/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 269 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2025-03-04 10:00:44,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2025-03-04 10:00:44,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2025-03-04 10:00:44,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:44,996 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;@50fea23a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:44,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-03-04 10:00:45,001 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:45,001 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:00:45,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:45,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:45,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:45,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash 809813, now seen corresponding path program 1 times [2025-03-04 10:00:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:45,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522426495] [2025-03-04 10:00:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:45,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:45,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:45,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:45,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:45,242 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,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:45,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522426495] [2025-03-04 10:00:45,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522426495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:45,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:45,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706421789] [2025-03-04 10:00:45,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:45,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:45,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:45,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-04 10:00:45,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:45,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-04 10:00:45,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:45,405 INFO L124 PetriNetUnfolderBase]: 64/330 cut-off events. [2025-03-04 10:00:45,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:45,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 330 events. 64/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1330 event pairs, 63 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 377. Up to 167 conditions per place. [2025-03-04 10:00:45,412 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-03-04 10:00:45,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2025-03-04 10:00:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-04 10:00:45,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2025-03-04 10:00:45,425 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2025-03-04 10:00:45,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2025-03-04 10:00:45,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:45,435 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2025-03-04 10:00:45,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2025-03-04 10:00:45,442 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2025-03-04 10:00:45,443 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2025-03-04 10:00:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:45,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:00:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:45,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:45,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash 25101010, now seen corresponding path program 1 times [2025-03-04 10:00:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981597699] [2025-03-04 10:00:45,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:45,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:00:45,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:00:45,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:45,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:45,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:45,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981597699] [2025-03-04 10:00:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981597699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573995721] [2025-03-04 10:00:45,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:45,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:45,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:45,577 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:45,578 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:45,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:00:45,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:00:45,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:45,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:45,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:00:45,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:45,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573995721] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:45,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:45,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:00:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771923033] [2025-03-04 10:00:45,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:45,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:45,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:45,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:45,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:45,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-04 10:00:45,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:45,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-04 10:00:45,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:45,918 INFO L124 PetriNetUnfolderBase]: 64/333 cut-off events. [2025-03-04 10:00:45,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:45,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 333 events. 64/333 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1324 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 506. Up to 167 conditions per place. [2025-03-04 10:00:45,921 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-04 10:00:45,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2025-03-04 10:00:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:00:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:00:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2025-03-04 10:00:45,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2025-03-04 10:00:45,925 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2025-03-04 10:00:45,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2025-03-04 10:00:45,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:45,931 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2025-03-04 10:00:45,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-03-04 10:00:45,932 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2025-03-04 10:00:45,932 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2025-03-04 10:00:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:45,932 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-04 10:00:45,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:00:46,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:46,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:46,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 456708757, now seen corresponding path program 2 times [2025-03-04 10:00:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:46,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642511997] [2025-03-04 10:00:46,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:46,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-04 10:00:46,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-03-04 10:00:46,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:46,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:00:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:46,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642511997] [2025-03-04 10:00:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642511997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:46,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:46,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742246592] [2025-03-04 10:00:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:46,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:46,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:46,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:46,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2025-03-04 10:00:46,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:46,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:46,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2025-03-04 10:00:46,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:46,508 INFO L124 PetriNetUnfolderBase]: 64/321 cut-off events. [2025-03-04 10:00:46,508 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:00:46,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 321 events. 64/321 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1277 event pairs, 63 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 491. Up to 165 conditions per place. [2025-03-04 10:00:46,513 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-03-04 10:00:46,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2025-03-04 10:00:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-04 10:00:46,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2025-03-04 10:00:46,515 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2025-03-04 10:00:46,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2025-03-04 10:00:46,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:46,520 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2025-03-04 10:00:46,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2025-03-04 10:00:46,521 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-04 10:00:46,521 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2025-03-04 10:00:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:46,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:46,522 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-04 10:00:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:00:46,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 456708758, now seen corresponding path program 1 times [2025-03-04 10:00:46,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872552998] [2025-03-04 10:00:46,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:46,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 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 7 of 7 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,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:46,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872552998] [2025-03-04 10:00:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872552998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097079668] [2025-03-04 10:00:46,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:46,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:46,643 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:46,644 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:46,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:00:46,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:00:46,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:46,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:46,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:00:46,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:46,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:46,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097079668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:46,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:46,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:00:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002793729] [2025-03-04 10:00:46,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:46,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:00:46,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:46,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:00:46,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:00:46,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-04 10:00:46,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:46,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-04 10:00:46,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:46,958 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2025-03-04 10:00:46,959 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 10:00:46,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 327 events. 64/327 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1281 event pairs, 63 based on Foata normal form. 6/256 useless extension candidates. Maximal degree in co-relation 497. Up to 167 conditions per place. [2025-03-04 10:00:46,962 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2025-03-04 10:00:46,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2025-03-04 10:00:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:00:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:00:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2025-03-04 10:00:46,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2025-03-04 10:00:46,969 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2025-03-04 10:00:46,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2025-03-04 10:00:46,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:46,975 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2025-03-04 10:00:46,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2025-03-04 10:00:46,976 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2025-03-04 10:00:46,976 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2025-03-04 10:00:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:46,977 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-03-04 10:00:46,985 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:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:00:47,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2039675254, now seen corresponding path program 2 times [2025-03-04 10:00:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:47,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808842906] [2025-03-04 10:00:47,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:47,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:00:47,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-03-04 10:00:47,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:47,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808842906] [2025-03-04 10:00:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808842906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:47,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599418572] [2025-03-04 10:00:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:47,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:47,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:47,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-03-04 10:00:47,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:47,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:47,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-03-04 10:00:47,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:47,495 INFO L124 PetriNetUnfolderBase]: 64/315 cut-off events. [2025-03-04 10:00:47,496 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 10:00:47,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 315 events. 64/315 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1237 event pairs, 63 based on Foata normal form. 6/250 useless extension candidates. Maximal degree in co-relation 479. Up to 171 conditions per place. [2025-03-04 10:00:47,498 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2025-03-04 10:00:47,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2025-03-04 10:00:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-03-04 10:00:47,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2025-03-04 10:00:47,499 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2025-03-04 10:00:47,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2025-03-04 10:00:47,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-04 10:00:47,503 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2025-03-04 10:00:47,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2025-03-04 10:00:47,504 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-04 10:00:47,504 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2025-03-04 10:00:47,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:47,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:47,505 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-04 10:00:47,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:00:47,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:47,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:47,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1622852575, now seen corresponding path program 1 times [2025-03-04 10:00:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:47,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119260696] [2025-03-04 10:00:47,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:47,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:00:47,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:00:47,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119260696] [2025-03-04 10:00:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119260696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:47,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:47,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170692156] [2025-03-04 10:00:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:47,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:47,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:47,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2025-03-04 10:00:47,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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:47,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:47,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2025-03-04 10:00:47,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:48,013 INFO L124 PetriNetUnfolderBase]: 73/329 cut-off events. [2025-03-04 10:00:48,013 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 10:00:48,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 329 events. 73/329 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1333 event pairs, 72 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 530. Up to 201 conditions per place. [2025-03-04 10:00:48,020 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2025-03-04 10:00:48,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2025-03-04 10:00:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-04 10:00:48,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2025-03-04 10:00:48,026 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2025-03-04 10:00:48,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2025-03-04 10:00:48,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:48,031 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2025-03-04 10:00:48,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-03-04 10:00:48,032 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2025-03-04 10:00:48,033 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2025-03-04 10:00:48,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:48,033 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-04 10:00:48,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:00:48,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:48,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1622852576, now seen corresponding path program 1 times [2025-03-04 10:00:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:48,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495315506] [2025-03-04 10:00:48,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:48,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:00:48,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:00:48,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:48,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:48,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495315506] [2025-03-04 10:00:48,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495315506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:48,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:48,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:48,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484503642] [2025-03-04 10:00:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:48,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:48,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:48,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2025-03-04 10:00:48,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:48,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2025-03-04 10:00:48,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:48,702 INFO L124 PetriNetUnfolderBase]: 73/323 cut-off events. [2025-03-04 10:00:48,703 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 10:00:48,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 323 events. 73/323 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1294 event pairs, 63 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 540. Up to 158 conditions per place. [2025-03-04 10:00:48,704 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2025-03-04 10:00:48,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2025-03-04 10:00:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2025-03-04 10:00:48,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2025-03-04 10:00:48,707 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2025-03-04 10:00:48,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2025-03-04 10:00:48,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:48,712 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2025-03-04 10:00:48,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2025-03-04 10:00:48,712 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2025-03-04 10:00:48,713 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2025-03-04 10:00:48,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:48,714 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:48,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:00:48,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:48,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1029811867, now seen corresponding path program 1 times [2025-03-04 10:00:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200556810] [2025-03-04 10:00:48,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:48,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:00:48,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:00:48,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:48,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200556810] [2025-03-04 10:00:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200556810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:48,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:00:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072389635] [2025-03-04 10:00:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:48,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:48,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:48,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:49,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-03-04 10:00:49,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:49,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-03-04 10:00:49,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:49,628 INFO L124 PetriNetUnfolderBase]: 64/291 cut-off events. [2025-03-04 10:00:49,629 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 10:00:49,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 291 events. 64/291 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 63 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 524. Up to 166 conditions per place. [2025-03-04 10:00:49,630 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-04 10:00:49,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2025-03-04 10:00:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:00:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:00:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2025-03-04 10:00:49,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2025-03-04 10:00:49,632 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2025-03-04 10:00:49,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2025-03-04 10:00:49,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:49,634 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2025-03-04 10:00:49,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2025-03-04 10:00:49,635 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2025-03-04 10:00:49,636 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2025-03-04 10:00:49,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:49,636 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:49,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:00:49,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:49,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1029811868, now seen corresponding path program 1 times [2025-03-04 10:00:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:49,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125258503] [2025-03-04 10:00:49,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:00:49,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:00:49,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:49,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:49,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:49,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125258503] [2025-03-04 10:00:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125258503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:49,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:00:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924969842] [2025-03-04 10:00:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:49,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:49,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:50,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2025-03-04 10:00:50,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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:50,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:50,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2025-03-04 10:00:50,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:50,721 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-03-04 10:00:50,721 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 10:00:50,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 289 events. 64/289 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1141 event pairs, 63 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 516. Up to 172 conditions per place. [2025-03-04 10:00:50,723 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2025-03-04 10:00:50,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2025-03-04 10:00:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:00:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:00:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2025-03-04 10:00:50,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2025-03-04 10:00:50,725 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2025-03-04 10:00:50,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2025-03-04 10:00:50,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:00:50,727 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2025-03-04 10:00:50,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2025-03-04 10:00:50,728 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2025-03-04 10:00:50,728 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2025-03-04 10:00:50,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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:50,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:50,728 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:50,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:00:50,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1806752497, now seen corresponding path program 1 times [2025-03-04 10:00:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41573019] [2025-03-04 10:00:50,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:50,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:00:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:00:50,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:50,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41573019] [2025-03-04 10:00:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41573019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:50,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:50,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:50,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724138944] [2025-03-04 10:00:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:50,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:50,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:50,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:51,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-03-04 10:00:51,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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:51,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:51,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-03-04 10:00:51,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:51,249 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2025-03-04 10:00:51,250 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 10:00:51,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 288 events. 64/288 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1136 event pairs, 63 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 502. Up to 171 conditions per place. [2025-03-04 10:00:51,250 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-03-04 10:00:51,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2025-03-04 10:00:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2025-03-04 10:00:51,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477611940298508 [2025-03-04 10:00:51,253 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 434 transitions. [2025-03-04 10:00:51,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2025-03-04 10:00:51,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:00:51,255 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2025-03-04 10:00:51,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2025-03-04 10:00:51,255 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2025-03-04 10:00:51,255 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2025-03-04 10:00:51,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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:51,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:51,255 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:51,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:00:51,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:51,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1806752496, now seen corresponding path program 1 times [2025-03-04 10:00:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260688677] [2025-03-04 10:00:51,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:00:51,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:00:51,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260688677] [2025-03-04 10:00:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260688677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:51,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:51,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:51,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920965105] [2025-03-04 10:00:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:51,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:51,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:51,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:51,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-03-04 10:00:51,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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:51,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:51,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-03-04 10:00:51,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:51,662 INFO L124 PetriNetUnfolderBase]: 64/287 cut-off events. [2025-03-04 10:00:51,662 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 10:00:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 287 events. 64/287 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1136 event pairs, 63 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 507. Up to 171 conditions per place. [2025-03-04 10:00:51,663 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2025-03-04 10:00:51,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2025-03-04 10:00:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2025-03-04 10:00:51,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2025-03-04 10:00:51,664 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2025-03-04 10:00:51,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2025-03-04 10:00:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:51,666 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2025-03-04 10:00:51,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2025-03-04 10:00:51,667 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2025-03-04 10:00:51,667 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2025-03-04 10:00:51,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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:51,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:51,667 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:51,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:00:51,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:51,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash 434299222, now seen corresponding path program 1 times [2025-03-04 10:00:51,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:51,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634134319] [2025-03-04 10:00:51,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:51,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:00:51,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:00:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634134319] [2025-03-04 10:00:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634134319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306874364] [2025-03-04 10:00:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:51,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:51,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:52,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-03-04 10:00:52,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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:52,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:52,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-03-04 10:00:52,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:52,390 INFO L124 PetriNetUnfolderBase]: 73/311 cut-off events. [2025-03-04 10:00:52,391 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 10:00:52,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 311 events. 73/311 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1282 event pairs, 63 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 541. Up to 164 conditions per place. [2025-03-04 10:00:52,392 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2025-03-04 10:00:52,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2025-03-04 10:00:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2025-03-04 10:00:52,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2025-03-04 10:00:52,394 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2025-03-04 10:00:52,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2025-03-04 10:00:52,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:52,396 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2025-03-04 10:00:52,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-03-04 10:00:52,397 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2025-03-04 10:00:52,398 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2025-03-04 10:00:52,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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:52,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:52,398 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:52,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:00:52,399 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:52,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1046515687, now seen corresponding path program 1 times [2025-03-04 10:00:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165887626] [2025-03-04 10:00:52,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:52,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:00:52,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:00:52,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:52,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 10:00:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165887626] [2025-03-04 10:00:52,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165887626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:52,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:52,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:00:52,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980618230] [2025-03-04 10:00:52,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:52,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:52,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:52,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:53,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 134 [2025-03-04 10:00:53,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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:53,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:53,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 134 [2025-03-04 10:00:53,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:53,331 INFO L124 PetriNetUnfolderBase]: 64/280 cut-off events. [2025-03-04 10:00:53,331 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 10:00:53,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 280 events. 64/280 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 54 based on Foata normal form. 2/239 useless extension candidates. Maximal degree in co-relation 491. Up to 132 conditions per place. [2025-03-04 10:00:53,333 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 42 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2025-03-04 10:00:53,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 377 flow [2025-03-04 10:00:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:00:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:00:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 573 transitions. [2025-03-04 10:00:53,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108742004264393 [2025-03-04 10:00:53,335 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 573 transitions. [2025-03-04 10:00:53,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 377 flow [2025-03-04 10:00:53,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 371 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:00:53,339 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2025-03-04 10:00:53,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2025-03-04 10:00:53,339 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2025-03-04 10:00:53,340 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2025-03-04 10:00:53,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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:53,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:53,341 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:00:53,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:53,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1046515688, now seen corresponding path program 1 times [2025-03-04 10:00:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:53,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590215157] [2025-03-04 10:00:53,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:53,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:00:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:00:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 10:00:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590215157] [2025-03-04 10:00:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590215157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:00:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800436715] [2025-03-04 10:00:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:53,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:53,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:53,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:53,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-03-04 10:00:53,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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:53,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:53,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-03-04 10:00:53,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:54,077 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2025-03-04 10:00:54,077 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 10:00:54,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 278 events. 64/278 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1121 event pairs, 54 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 512. Up to 130 conditions per place. [2025-03-04 10:00:54,079 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2025-03-04 10:00:54,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2025-03-04 10:00:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:00:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:00:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2025-03-04 10:00:54,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2025-03-04 10:00:54,082 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2025-03-04 10:00:54,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2025-03-04 10:00:54,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:00:54,085 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2025-03-04 10:00:54,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2025-03-04 10:00:54,085 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2025-03-04 10:00:54,085 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2025-03-04 10:00:54,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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:54,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:54,086 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:54,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:00:54,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:54,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -679203265, now seen corresponding path program 1 times [2025-03-04 10:00:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070408959] [2025-03-04 10:00:54,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:54,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:00:54,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:00:54,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:54,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 10:00:54,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:54,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070408959] [2025-03-04 10:00:54,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070408959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:54,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:54,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144787454] [2025-03-04 10:00:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:54,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:54,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:54,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:54,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:54,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-03-04 10:00:54,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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:54,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:54,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-03-04 10:00:54,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:54,503 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-03-04 10:00:54,503 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 10:00:54,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 277 events. 64/277 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1108 event pairs, 63 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 510. Up to 170 conditions per place. [2025-03-04 10:00:54,505 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2025-03-04 10:00:54,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2025-03-04 10:00:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2025-03-04 10:00:54,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2025-03-04 10:00:54,506 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2025-03-04 10:00:54,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2025-03-04 10:00:54,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:00:54,508 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2025-03-04 10:00:54,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2025-03-04 10:00:54,509 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2025-03-04 10:00:54,509 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2025-03-04 10:00:54,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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:54,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:54,510 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:54,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:00:54,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash -679203264, now seen corresponding path program 1 times [2025-03-04 10:00:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552870586] [2025-03-04 10:00:54,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:54,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:00:54,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:00:54,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 10:00:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:54,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552870586] [2025-03-04 10:00:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552870586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:54,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770158616] [2025-03-04 10:00:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:54,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:54,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:54,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:54,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-03-04 10:00:54,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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:54,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:54,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-03-04 10:00:54,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:54,987 INFO L124 PetriNetUnfolderBase]: 64/276 cut-off events. [2025-03-04 10:00:54,987 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 10:00:54,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 276 events. 64/276 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1103 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 489. Up to 170 conditions per place. [2025-03-04 10:00:54,989 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2025-03-04 10:00:54,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2025-03-04 10:00:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2025-03-04 10:00:54,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2025-03-04 10:00:54,990 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2025-03-04 10:00:54,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2025-03-04 10:00:54,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:54,992 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2025-03-04 10:00:54,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-03-04 10:00:54,993 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2025-03-04 10:00:54,993 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2025-03-04 10:00:54,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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:54,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:54,993 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:54,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:00:54,994 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-04 10:00:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash 45814675, now seen corresponding path program 1 times [2025-03-04 10:00:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626859371] [2025-03-04 10:00:54,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:54,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:55,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:00:55,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:00:55,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:55,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626859371] [2025-03-04 10:00:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626859371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525875887] [2025-03-04 10:00:56,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:56,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:56,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:56,302 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:56,303 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:56,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:00:56,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:00:56,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:56,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:56,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-04 10:00:56,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:56,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:00:56,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 10:00:56,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 10:00:56,631 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-04 10:00:56,632 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 20 treesize of output 22 [2025-03-04 10:00:56,823 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2025-03-04 10:00:56,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 37 [2025-03-04 10:00:56,844 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-03-04 10:00:56,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 30 [2025-03-04 10:00:57,017 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-04 10:00:57,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 38 [2025-03-04 10:00:57,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:57,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:57,034 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2025-03-04 10:00:57,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2025-03-04 10:00:57,062 INFO L349 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2025-03-04 10:00:57,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2025-03-04 10:00:57,103 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-04 10:00:57,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2025-03-04 10:00:57,686 INFO L349 Elim1Store]: treesize reduction 24, result has 83.4 percent of original size [2025-03-04 10:00:57,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 185 treesize of output 269 [2025-03-04 10:00:57,724 INFO L349 Elim1Store]: treesize reduction 92, result has 27.6 percent of original size [2025-03-04 10:00:57,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 163 [2025-03-04 10:00:58,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:58,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 216 treesize of output 128 [2025-03-04 10:00:58,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:58,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2025-03-04 10:00:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:59,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:59,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:59,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 130 treesize of output 284 [2025-03-04 10:02:10,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-04 10:02:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:02:10,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525875887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:02:10,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:02:10,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 39 [2025-03-04 10:02:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314608701] [2025-03-04 10:02:10,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:02:10,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:02:10,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:10,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:02:10,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560