./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:58:02,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:58:02,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:58:02,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:58:02,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:58:02,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:58:02,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:58:02,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:58:02,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:58:02,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:58:02,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:58:02,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:58:02,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:58:02,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:58:02,902 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:58:02,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:58:02,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:58:02,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:58:02,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:58:02,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:58:02,902 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:58:02,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:58:02,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:02,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:58:02,904 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-02-06 12:58:03,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:58:03,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:58:03,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:58:03,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:58:03,211 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:58:03,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-02-06 12:58:04,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aaea639a/8ce9f67b8d4744cd8a9c9ffd269ad3e3/FLAG2667d6816 [2025-02-06 12:58:04,897 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:58:04,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-02-06 12:58:04,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aaea639a/8ce9f67b8d4744cd8a9c9ffd269ad3e3/FLAG2667d6816 [2025-02-06 12:58:04,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aaea639a/8ce9f67b8d4744cd8a9c9ffd269ad3e3 [2025-02-06 12:58:04,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:58:04,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:58:04,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:04,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:58:04,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:58:04,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:04" (1/1) ... [2025-02-06 12:58:04,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b43be4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:04, skipping insertion in model container [2025-02-06 12:58:04,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:04" (1/1) ... [2025-02-06 12:58:04,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:58:05,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:05,531 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:58:05,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:05,652 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:58:05,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05 WrapperNode [2025-02-06 12:58:05,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:05,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:05,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:58:05,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:58:05,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,702 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 320 [2025-02-06 12:58:05,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:05,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:58:05,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:58:05,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:58:05,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,740 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 75, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 7 writes are split as follows [0, 0, 6, 1]. [2025-02-06 12:58:05,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:58:05,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:58:05,763 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:58:05,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:58:05,764 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:05,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:05,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:58:05,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:58:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:58:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:58:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:58:05,825 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:58:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:58:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:58:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:58:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:58:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:58:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:58:05,827 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:58:05,993 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:58:05,995 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:58:06,472 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 12:58:06,472 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 12:58:06,576 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:58:06,577 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:58:06,957 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:58:06,958 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:58:06,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:06 BoogieIcfgContainer [2025-02-06 12:58:06,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:58:06,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:58:06,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:58:06,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:58:06,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:58:04" (1/3) ... [2025-02-06 12:58:06,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fd1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:06, skipping insertion in model container [2025-02-06 12:58:06,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (2/3) ... [2025-02-06 12:58:06,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fd1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:06, skipping insertion in model container [2025-02-06 12:58:06,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:06" (3/3) ... [2025-02-06 12:58:06,970 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-02-06 12:58:06,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:58:06,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 165 locations, 1 initial locations, 20 loop locations, and 38 error locations. [2025-02-06 12:58:06,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:58:07,053 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:58:07,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 208 transitions, 423 flow [2025-02-06 12:58:07,167 INFO L124 PetriNetUnfolderBase]: 70/344 cut-off events. [2025-02-06 12:58:07,168 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:58:07,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 344 events. 70/344 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2048 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 201. Up to 8 conditions per place. [2025-02-06 12:58:07,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 208 transitions, 423 flow [2025-02-06 12:58:07,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 208 transitions, 423 flow [2025-02-06 12:58:07,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:07,205 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;@30b09247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:07,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-06 12:58:07,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:07,214 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-02-06 12:58:07,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:07,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:07,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:58:07,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:07,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 26508760, now seen corresponding path program 1 times [2025-02-06 12:58:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:07,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220278006] [2025-02-06 12:58:07,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:07,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:07,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:58:07,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:58:07,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:07,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:07,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220278006] [2025-02-06 12:58:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220278006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:07,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:07,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391792769] [2025-02-06 12:58:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:07,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:07,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:07,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 208 [2025-02-06 12:58:07,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 208 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:07,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:07,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 208 [2025-02-06 12:58:07,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:08,315 INFO L124 PetriNetUnfolderBase]: 1062/3713 cut-off events. [2025-02-06 12:58:08,317 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:58:08,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5730 conditions, 3713 events. 1062/3713 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 33741 event pairs, 903 based on Foata normal form. 987/4174 useless extension candidates. Maximal degree in co-relation 5555. Up to 2011 conditions per place. [2025-02-06 12:58:08,348 INFO L140 encePairwiseOnDemand]: 169/208 looper letters, 71 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-02-06 12:58:08,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 170 transitions, 493 flow [2025-02-06 12:58:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2025-02-06 12:58:08,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6426282051282052 [2025-02-06 12:58:08,366 INFO L175 Difference]: Start difference. First operand has 168 places, 208 transitions, 423 flow. Second operand 3 states and 401 transitions. [2025-02-06 12:58:08,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 170 transitions, 493 flow [2025-02-06 12:58:08,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 493 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:08,378 INFO L231 Difference]: Finished difference. Result has 168 places, 170 transitions, 357 flow [2025-02-06 12:58:08,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=168, PETRI_TRANSITIONS=170} [2025-02-06 12:58:08,384 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2025-02-06 12:58:08,384 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 170 transitions, 357 flow [2025-02-06 12:58:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:08,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:08,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:58:08,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:08,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash 821749714, now seen corresponding path program 1 times [2025-02-06 12:58:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:08,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855348157] [2025-02-06 12:58:08,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:08,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:08,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:08,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:08,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855348157] [2025-02-06 12:58:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855348157] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:08,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351658092] [2025-02-06 12:58:08,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:08,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:08,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:08,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:08,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:58:08,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:08,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:08,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:08,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:08,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:58:08,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:08,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:08,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351658092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:08,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 12:58:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454408738] [2025-02-06 12:58:08,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:08,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:58:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:08,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:58:08,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:58:08,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 208 [2025-02-06 12:58:08,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 170 transitions, 357 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:08,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:08,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 208 [2025-02-06 12:58:08,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:09,367 INFO L124 PetriNetUnfolderBase]: 1062/3716 cut-off events. [2025-02-06 12:58:09,368 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:58:09,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5746 conditions, 3716 events. 1062/3716 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 33683 event pairs, 903 based on Foata normal form. 0/3190 useless extension candidates. Maximal degree in co-relation 5734. Up to 2011 conditions per place. [2025-02-06 12:58:09,397 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 71 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2025-02-06 12:58:09,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 173 transitions, 521 flow [2025-02-06 12:58:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:58:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:58:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 661 transitions. [2025-02-06 12:58:09,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296474358974359 [2025-02-06 12:58:09,402 INFO L175 Difference]: Start difference. First operand has 168 places, 170 transitions, 357 flow. Second operand 6 states and 661 transitions. [2025-02-06 12:58:09,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 173 transitions, 521 flow [2025-02-06 12:58:09,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 173 transitions, 517 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:09,408 INFO L231 Difference]: Finished difference. Result has 175 places, 173 transitions, 389 flow [2025-02-06 12:58:09,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=389, PETRI_PLACES=175, PETRI_TRANSITIONS=173} [2025-02-06 12:58:09,409 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places. [2025-02-06 12:58:09,409 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 173 transitions, 389 flow [2025-02-06 12:58:09,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:09,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:09,410 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:09,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:58:09,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:09,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:09,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash -589550504, now seen corresponding path program 2 times [2025-02-06 12:58:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:09,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017086804] [2025-02-06 12:58:09,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:09,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 12:58:09,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-02-06 12:58:09,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:09,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 12:58:09,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:09,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017086804] [2025-02-06 12:58:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017086804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:09,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537483681] [2025-02-06 12:58:09,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:09,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:09,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:09,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:09,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2025-02-06 12:58:09,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 173 transitions, 389 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-02-06 12:58:09,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:09,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2025-02-06 12:58:09,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:10,250 INFO L124 PetriNetUnfolderBase]: 1108/3786 cut-off events. [2025-02-06 12:58:10,250 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 12:58:10,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5920 conditions, 3786 events. 1108/3786 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 34172 event pairs, 903 based on Foata normal form. 0/3301 useless extension candidates. Maximal degree in co-relation 5886. Up to 2007 conditions per place. [2025-02-06 12:58:10,275 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 98 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-02-06 12:58:10,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 193 transitions, 629 flow [2025-02-06 12:58:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-02-06 12:58:10,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-02-06 12:58:10,278 INFO L175 Difference]: Start difference. First operand has 175 places, 173 transitions, 389 flow. Second operand 3 states and 377 transitions. [2025-02-06 12:58:10,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 193 transitions, 629 flow [2025-02-06 12:58:10,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 193 transitions, 615 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:10,282 INFO L231 Difference]: Finished difference. Result has 174 places, 171 transitions, 375 flow [2025-02-06 12:58:10,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=174, PETRI_TRANSITIONS=171} [2025-02-06 12:58:10,283 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 6 predicate places. [2025-02-06 12:58:10,284 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 171 transitions, 375 flow [2025-02-06 12:58:10,284 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-02-06 12:58:10,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:10,284 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:10,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:58:10,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -589550503, now seen corresponding path program 1 times [2025-02-06 12:58:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:10,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137333191] [2025-02-06 12:58:10,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:10,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:10,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:10,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:10,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:10,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:10,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137333191] [2025-02-06 12:58:10,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137333191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:10,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634766483] [2025-02-06 12:58:10,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:10,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:10,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:10,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:10,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:58:10,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:10,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:10,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:10,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:10,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:58:10,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:10,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634766483] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:10,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 12:58:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338874474] [2025-02-06 12:58:10,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:10,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:58:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:10,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:58:10,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:58:10,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 208 [2025-02-06 12:58:10,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 171 transitions, 375 flow. Second operand has 13 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:10,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:10,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 208 [2025-02-06 12:58:10,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:11,198 INFO L124 PetriNetUnfolderBase]: 1062/3698 cut-off events. [2025-02-06 12:58:11,199 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-02-06 12:58:11,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 3698 events. 1062/3698 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 33352 event pairs, 903 based on Foata normal form. 6/3203 useless extension candidates. Maximal degree in co-relation 5725. Up to 2011 conditions per place. [2025-02-06 12:58:11,219 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 71 selfloop transitions, 11 changer transitions 0/177 dead transitions. [2025-02-06 12:58:11,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 177 transitions, 575 flow [2025-02-06 12:58:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:58:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:58:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1252 transitions. [2025-02-06 12:58:11,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5016025641025641 [2025-02-06 12:58:11,227 INFO L175 Difference]: Start difference. First operand has 174 places, 171 transitions, 375 flow. Second operand 12 states and 1252 transitions. [2025-02-06 12:58:11,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 177 transitions, 575 flow [2025-02-06 12:58:11,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 177 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:11,235 INFO L231 Difference]: Finished difference. Result has 189 places, 177 transitions, 455 flow [2025-02-06 12:58:11,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=455, PETRI_PLACES=189, PETRI_TRANSITIONS=177} [2025-02-06 12:58:11,238 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 21 predicate places. [2025-02-06 12:58:11,239 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 177 transitions, 455 flow [2025-02-06 12:58:11,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:11,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:11,242 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-02-06 12:58:11,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:58:11,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:11,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash 266508825, now seen corresponding path program 2 times [2025-02-06 12:58:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532156785] [2025-02-06 12:58:11,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:11,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 12:58:11,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-02-06 12:58:11,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:11,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:58:11,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532156785] [2025-02-06 12:58:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532156785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:11,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383619493] [2025-02-06 12:58:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:11,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:11,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:11,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:11,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 208 [2025-02-06 12:58:11,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 177 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:11,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:11,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 208 [2025-02-06 12:58:11,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:12,048 INFO L124 PetriNetUnfolderBase]: 1037/3463 cut-off events. [2025-02-06 12:58:12,049 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 12:58:12,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5527 conditions, 3463 events. 1037/3463 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 31246 event pairs, 0 based on Foata normal form. 1/3050 useless extension candidates. Maximal degree in co-relation 5451. Up to 1975 conditions per place. [2025-02-06 12:58:12,074 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 104 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-02-06 12:58:12,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 200 transitions, 713 flow [2025-02-06 12:58:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-02-06 12:58:12,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185897435897436 [2025-02-06 12:58:12,078 INFO L175 Difference]: Start difference. First operand has 189 places, 177 transitions, 455 flow. Second operand 3 states and 386 transitions. [2025-02-06 12:58:12,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 200 transitions, 713 flow [2025-02-06 12:58:12,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 200 transitions, 665 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-02-06 12:58:12,086 INFO L231 Difference]: Finished difference. Result has 187 places, 177 transitions, 417 flow [2025-02-06 12:58:12,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=187, PETRI_TRANSITIONS=177} [2025-02-06 12:58:12,087 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 19 predicate places. [2025-02-06 12:58:12,089 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 177 transitions, 417 flow [2025-02-06 12:58:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:12,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:12,090 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:12,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:58:12,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:12,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -872973268, now seen corresponding path program 1 times [2025-02-06 12:58:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326592511] [2025-02-06 12:58:12,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:12,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:58:12,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:58:12,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:12,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:58:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326592511] [2025-02-06 12:58:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326592511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:12,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:12,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:58:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803639106] [2025-02-06 12:58:12,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:12,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:58:12,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:12,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:58:12,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:58:12,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 208 [2025-02-06 12:58:12,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 177 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:12,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:12,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 208 [2025-02-06 12:58:12,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:12,585 INFO L124 PetriNetUnfolderBase]: 72/288 cut-off events. [2025-02-06 12:58:12,585 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-02-06 12:58:12,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 288 events. 72/288 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1164 event pairs, 34 based on Foata normal form. 44/304 useless extension candidates. Maximal degree in co-relation 491. Up to 132 conditions per place. [2025-02-06 12:58:12,587 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 61 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-02-06 12:58:12,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 93 transitions, 368 flow [2025-02-06 12:58:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2025-02-06 12:58:12,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5228365384615384 [2025-02-06 12:58:12,590 INFO L175 Difference]: Start difference. First operand has 187 places, 177 transitions, 417 flow. Second operand 4 states and 435 transitions. [2025-02-06 12:58:12,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 93 transitions, 368 flow [2025-02-06 12:58:12,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 93 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:58:12,595 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 192 flow [2025-02-06 12:58:12,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2025-02-06 12:58:12,596 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -85 predicate places. [2025-02-06 12:58:12,596 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 192 flow [2025-02-06 12:58:12,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:12,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:12,597 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 12:58:12,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:58:12,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1292366675, now seen corresponding path program 1 times [2025-02-06 12:58:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357882031] [2025-02-06 12:58:12,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:12,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:58:12,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:58:12,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:12,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:12,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:58:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:58:12,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:12,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:12,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:12,693 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:12,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-02-06 12:58:12,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-02-06 12:58:12,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-02-06 12:58:12,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-02-06 12:58:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-02-06 12:58:12,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:58:12,704 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-02-06 12:58:12,706 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:12,707 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:58:12,764 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:58:12,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 274 transitions, 564 flow [2025-02-06 12:58:12,817 INFO L124 PetriNetUnfolderBase]: 113/558 cut-off events. [2025-02-06 12:58:12,817 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 12:58:12,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 558 events. 113/558 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3742 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2025-02-06 12:58:12,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 274 transitions, 564 flow [2025-02-06 12:58:12,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 274 transitions, 564 flow [2025-02-06 12:58:12,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:12,834 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;@30b09247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:12,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 12:58:12,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:12,837 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-02-06 12:58:12,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:12,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:12,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:58:12,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 34943576, now seen corresponding path program 1 times [2025-02-06 12:58:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766171294] [2025-02-06 12:58:12,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:58:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:58:12,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:12,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:12,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766171294] [2025-02-06 12:58:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766171294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:12,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:12,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:12,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823129261] [2025-02-06 12:58:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:12,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:12,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:12,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:12,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:12,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 274 [2025-02-06 12:58:12,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 274 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:12,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:12,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 274 [2025-02-06 12:58:12,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:19,737 INFO L124 PetriNetUnfolderBase]: 46715/105836 cut-off events. [2025-02-06 12:58:19,737 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-02-06 12:58:19,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173424 conditions, 105836 events. 46715/105836 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 2889. Compared 1304896 event pairs, 41202 based on Foata normal form. 32736/124794 useless extension candidates. Maximal degree in co-relation 160034. Up to 67470 conditions per place. [2025-02-06 12:58:20,722 INFO L140 encePairwiseOnDemand]: 223/274 looper letters, 95 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-02-06 12:58:20,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 223 transitions, 656 flow [2025-02-06 12:58:20,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-02-06 12:58:20,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6374695863746959 [2025-02-06 12:58:20,725 INFO L175 Difference]: Start difference. First operand has 221 places, 274 transitions, 564 flow. Second operand 3 states and 524 transitions. [2025-02-06 12:58:20,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 223 transitions, 656 flow [2025-02-06 12:58:20,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 223 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:20,730 INFO L231 Difference]: Finished difference. Result has 220 places, 223 transitions, 472 flow [2025-02-06 12:58:20,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=220, PETRI_TRANSITIONS=223} [2025-02-06 12:58:20,733 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, -1 predicate places. [2025-02-06 12:58:20,733 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 223 transitions, 472 flow [2025-02-06 12:58:20,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:20,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:20,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:20,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:58:20,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:20,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1083229284, now seen corresponding path program 1 times [2025-02-06 12:58:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669284585] [2025-02-06 12:58:20,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:20,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:20,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:20,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:20,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669284585] [2025-02-06 12:58:20,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669284585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927128796] [2025-02-06 12:58:20,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:20,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:20,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:20,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:58:20,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:20,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:20,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:20,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:20,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:58:20,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:20,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927128796] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:20,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:20,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 12:58:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974990989] [2025-02-06 12:58:20,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:20,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:58:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:20,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:58:20,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:58:20,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 274 [2025-02-06 12:58:20,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 223 transitions, 472 flow. Second operand has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:20,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:20,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 274 [2025-02-06 12:58:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:27,507 INFO L124 PetriNetUnfolderBase]: 46715/105839 cut-off events. [2025-02-06 12:58:27,507 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-02-06 12:58:27,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173440 conditions, 105839 events. 46715/105839 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 2889. Compared 1305101 event pairs, 41202 based on Foata normal form. 0/92061 useless extension candidates. Maximal degree in co-relation 173427. Up to 67470 conditions per place. [2025-02-06 12:58:28,178 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 95 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-02-06 12:58:28,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 226 transitions, 684 flow [2025-02-06 12:58:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:58:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:58:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2025-02-06 12:58:28,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5225060827250608 [2025-02-06 12:58:28,182 INFO L175 Difference]: Start difference. First operand has 220 places, 223 transitions, 472 flow. Second operand 6 states and 859 transitions. [2025-02-06 12:58:28,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 226 transitions, 684 flow [2025-02-06 12:58:28,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 226 transitions, 680 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:28,187 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 504 flow [2025-02-06 12:58:28,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2025-02-06 12:58:28,188 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 6 predicate places. [2025-02-06 12:58:28,188 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 504 flow [2025-02-06 12:58:28,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:28,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:28,189 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:28,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:58:28,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:28,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:28,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1922083496, now seen corresponding path program 2 times [2025-02-06 12:58:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468843872] [2025-02-06 12:58:28,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:28,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 12:58:28,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-02-06 12:58:28,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 12:58:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468843872] [2025-02-06 12:58:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468843872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:28,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460042836] [2025-02-06 12:58:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:28,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:28,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:28,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:28,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 274 [2025-02-06 12:58:28,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 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-02-06 12:58:28,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:28,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 274 [2025-02-06 12:58:28,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:35,458 INFO L124 PetriNetUnfolderBase]: 48771/109063 cut-off events. [2025-02-06 12:58:35,458 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-02-06 12:58:35,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179736 conditions, 109063 events. 48771/109063 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 2927. Compared 1337019 event pairs, 41181 based on Foata normal form. 0/95613 useless extension candidates. Maximal degree in co-relation 179701. Up to 67392 conditions per place. [2025-02-06 12:58:36,164 INFO L140 encePairwiseOnDemand]: 270/274 looper letters, 144 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-06 12:58:36,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 268 transitions, 880 flow [2025-02-06 12:58:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-02-06 12:58:36,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6204379562043796 [2025-02-06 12:58:36,166 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 504 flow. Second operand 3 states and 510 transitions. [2025-02-06 12:58:36,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 268 transitions, 880 flow [2025-02-06 12:58:36,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 268 transitions, 866 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:36,171 INFO L231 Difference]: Finished difference. Result has 226 places, 224 transitions, 490 flow [2025-02-06 12:58:36,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=226, PETRI_TRANSITIONS=224} [2025-02-06 12:58:36,173 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 5 predicate places. [2025-02-06 12:58:36,173 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 224 transitions, 490 flow [2025-02-06 12:58:36,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 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-02-06 12:58:36,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:36,174 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:36,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:58:36,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:36,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1922083495, now seen corresponding path program 1 times [2025-02-06 12:58:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:36,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746779669] [2025-02-06 12:58:36,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:36,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:36,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:36,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:36,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746779669] [2025-02-06 12:58:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746779669] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281402455] [2025-02-06 12:58:36,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:36,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:36,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:36,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:58:36,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:36,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:36,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:36,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:36,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:58:36,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:36,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:36,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281402455] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:36,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 12:58:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313920652] [2025-02-06 12:58:36,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:36,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:58:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:36,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:58:36,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:58:36,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 274 [2025-02-06 12:58:36,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 224 transitions, 490 flow. Second operand has 13 states, 13 states have (on average 127.15384615384616) internal successors, (1653), 13 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:36,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:36,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 274 [2025-02-06 12:58:36,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:43,226 INFO L124 PetriNetUnfolderBase]: 46715/105517 cut-off events. [2025-02-06 12:58:43,226 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-02-06 12:58:43,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173673 conditions, 105517 events. 46715/105517 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 2869. Compared 1297434 event pairs, 41202 based on Foata normal form. 6/92074 useless extension candidates. Maximal degree in co-relation 173620. Up to 67470 conditions per place. [2025-02-06 12:58:43,850 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 95 selfloop transitions, 11 changer transitions 0/230 dead transitions. [2025-02-06 12:58:43,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 738 flow [2025-02-06 12:58:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:58:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:58:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1624 transitions. [2025-02-06 12:58:43,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49391727493917276 [2025-02-06 12:58:43,854 INFO L175 Difference]: Start difference. First operand has 226 places, 224 transitions, 490 flow. Second operand 12 states and 1624 transitions. [2025-02-06 12:58:43,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 738 flow [2025-02-06 12:58:43,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 230 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:43,911 INFO L231 Difference]: Finished difference. Result has 241 places, 230 transitions, 570 flow [2025-02-06 12:58:43,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=570, PETRI_PLACES=241, PETRI_TRANSITIONS=230} [2025-02-06 12:58:43,912 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 20 predicate places. [2025-02-06 12:58:43,912 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 230 transitions, 570 flow [2025-02-06 12:58:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 127.15384615384616) internal successors, (1653), 13 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:43,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:43,913 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-02-06 12:58:43,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:58:44,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 12:58:44,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1999062567, now seen corresponding path program 2 times [2025-02-06 12:58:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488178940] [2025-02-06 12:58:44,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:44,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 12:58:44,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-02-06 12:58:44,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:44,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:58:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488178940] [2025-02-06 12:58:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488178940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307064741] [2025-02-06 12:58:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:44,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:44,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:44,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:44,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2025-02-06 12:58:44,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 230 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:44,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:44,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2025-02-06 12:58:44,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand