./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/weaver/popl20-more-array-sum2.wvr.c -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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:40:15,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:40:15,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:40:15,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:40:15,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:40:15,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:40:15,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:40:15,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:40:15,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:40:15,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:40:15,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:40:15,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:40:15,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:40:15,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:40:15,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:40:15,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:15,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:40:15,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:40:15,763 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-02-08 08:40:16,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:40:16,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:40:16,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:40:16,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:40:16,055 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:40:16,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-08 08:40:17,358 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c23f7aa23/ca5587cfa8b540778ac569a8bf57c786/FLAGda3c4ddd5 [2025-02-08 08:40:17,634 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:40:17,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-08 08:40:17,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c23f7aa23/ca5587cfa8b540778ac569a8bf57c786/FLAGda3c4ddd5 [2025-02-08 08:40:17,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c23f7aa23/ca5587cfa8b540778ac569a8bf57c786 [2025-02-08 08:40:17,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:40:17,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:40:17,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:17,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:40:17,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:40:17,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:17,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16199cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17, skipping insertion in model container [2025-02-08 08:40:17,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:17,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:40:17,878 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:40:17,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:17,901 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:40:17,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:17,948 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:40:17,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17 WrapperNode [2025-02-08 08:40:17,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:17,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:17,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:40:17,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:40:17,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:17,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,002 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 251 [2025-02-08 08:40:18,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:18,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:40:18,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:40:18,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:40:18,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,043 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 08:40:18,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,060 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:40:18,066 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:40:18,067 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:40:18,067 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:40:18,068 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (1/1) ... [2025-02-08 08:40:18,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:18,114 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-08 08:40:18,116 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-08 08:40:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:40:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:40:18,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:40:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:40:18,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:40:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:40:18,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:40:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:40:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:40:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:40:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:40:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:40:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:40:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:40:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:40:18,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:40:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:40:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:40:18,143 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:40:18,257 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:40:18,259 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:40:18,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:40:18,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~post5#1; [2025-02-08 08:40:18,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: ~i~0#1 := 1 + #t~post5#1; [2025-02-08 08:40:18,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: #t~post5#1 := ~i~0#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume false; [2025-02-08 08:40:18,442 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume false; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: havoc #t~ret4#1; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-1: havoc #t~ret3#1; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-2: havoc #t~mem2#1; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-3: havoc #t~mem1#1; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-4: ~res1~0 := #t~ret4#1; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:18,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-8: #t~ret4#1 := plus_#res#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-10: havoc plus_#res#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res1~0, #t~ret3#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-15: #t~ret3#1 := plus_#res#1; [2025-02-08 08:40:18,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51: [2025-02-08 08:40:18,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:40:18,445 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: havoc #t~ret9#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-1: havoc #t~ret8#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-2: havoc #t~mem7#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-3: havoc #t~mem6#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-4: ~res2~0 := #t~ret9#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: #t~ret9#1 := plus_#res#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc plus_#res#1; [2025-02-08 08:40:18,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret8#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-15: #t~ret8#1 := plus_#res#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume false; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:18,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume false; [2025-02-08 08:40:18,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-1: havoc #t~post10#1; [2025-02-08 08:40:18,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: ~i~1#1 := 1 + #t~post10#1; [2025-02-08 08:40:18,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: #t~post10#1 := ~i~1#1; [2025-02-08 08:40:18,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:40:18,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: #t~post15#1 := ~i~2#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~ret14#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: havoc #t~ret13#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: havoc #t~mem12#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume false; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-3: havoc #t~mem11#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-4: ~res2~0 := #t~ret14#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume false; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-8: #t~ret14#1 := plus_#res#1; [2025-02-08 08:40:18,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-10: havoc plus_#res#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret13#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-15: #t~ret13#1 := plus_#res#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~post15#1; [2025-02-08 08:40:18,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: ~i~2#1 := 1 + #t~post15#1; [2025-02-08 08:40:18,804 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:40:18,805 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:40:19,113 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L116-1 is not an error location. [2025-02-08 08:40:19,113 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L116-1 is not an error location. [2025-02-08 08:40:19,114 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L116-1 is not an error location. [2025-02-08 08:40:19,115 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:40:19,115 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:40:19,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:19 BoogieIcfgContainer [2025-02-08 08:40:19,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:40:19,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:40:19,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:40:19,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:40:19,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:40:17" (1/3) ... [2025-02-08 08:40:19,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52355410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:19, skipping insertion in model container [2025-02-08 08:40:19,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:17" (2/3) ... [2025-02-08 08:40:19,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52355410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:19, skipping insertion in model container [2025-02-08 08:40:19,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:19" (3/3) ... [2025-02-08 08:40:19,131 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-02-08 08:40:19,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:40:19,147 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 51 locations, 1 initial locations, 5 loop locations, and 18 error locations. [2025-02-08 08:40:19,148 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:40:19,222 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:40:19,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 52 transitions, 125 flow [2025-02-08 08:40:19,295 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-02-08 08:40:19,297 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:40:19,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-08 08:40:19,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 52 transitions, 125 flow [2025-02-08 08:40:19,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 48 transitions, 114 flow [2025-02-08 08:40:19,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:40:19,331 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;@10282c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:40:19,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-08 08:40:19,337 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:40:19,337 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:40:19,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:40:19,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:19,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:19,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:19,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash 685549, now seen corresponding path program 1 times [2025-02-08 08:40:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:19,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980819129] [2025-02-08 08:40:19,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:19,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:19,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:19,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:19,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:19,595 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-08 08:40:19,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980819129] [2025-02-08 08:40:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980819129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:40:19,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306427327] [2025-02-08 08:40:19,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:19,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:19,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:19,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:19,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:40:19,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:19,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:19,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:20,265 INFO L124 PetriNetUnfolderBase]: 2536/3859 cut-off events. [2025-02-08 08:40:20,265 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-02-08 08:40:20,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7866 conditions, 3859 events. 2536/3859 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 25024 event pairs, 2534 based on Foata normal form. 1/2045 useless extension candidates. Maximal degree in co-relation 7381. Up to 3778 conditions per place. [2025-02-08 08:40:20,303 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-02-08 08:40:20,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 182 flow [2025-02-08 08:40:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-08 08:40:20,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2025-02-08 08:40:20,318 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 114 flow. Second operand 3 states and 71 transitions. [2025-02-08 08:40:20,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 182 flow [2025-02-08 08:40:20,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:20,334 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 98 flow [2025-02-08 08:40:20,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-02-08 08:40:20,342 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -8 predicate places. [2025-02-08 08:40:20,342 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 98 flow [2025-02-08 08:40:20,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:40:20,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:20,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:20,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:40:20,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:20,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 685550, now seen corresponding path program 1 times [2025-02-08 08:40:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:20,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-02-08 08:40:20,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:20,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:20,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:20,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:20,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,685 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-08 08:40:20,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:20,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-02-08 08:40:20,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109407212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:20,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:20,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877615060] [2025-02-08 08:40:20,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:20,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:20,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:20,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:20,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:20,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:20,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-08 08:40:20,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:20,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:20,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:21,267 INFO L124 PetriNetUnfolderBase]: 2537/3862 cut-off events. [2025-02-08 08:40:21,268 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:40:21,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7728 conditions, 3862 events. 2537/3862 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 24971 event pairs, 2534 based on Foata normal form. 0/2045 useless extension candidates. Maximal degree in co-relation 7699. Up to 3787 conditions per place. [2025-02-08 08:40:21,297 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 39 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-02-08 08:40:21,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 190 flow [2025-02-08 08:40:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-02-08 08:40:21,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2025-02-08 08:40:21,302 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 98 flow. Second operand 4 states and 84 transitions. [2025-02-08 08:40:21,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 190 flow [2025-02-08 08:40:21,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:21,305 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 121 flow [2025-02-08 08:40:21,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-02-08 08:40:21,306 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-02-08 08:40:21,306 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 121 flow [2025-02-08 08:40:21,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-08 08:40:21,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:21,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:40:21,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:40:21,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:21,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash 21254441, now seen corresponding path program 1 times [2025-02-08 08:40:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270782716] [2025-02-08 08:40:21,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:21,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:40:21,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:40:21,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:21,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:21,488 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-08 08:40:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270782716] [2025-02-08 08:40:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270782716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:21,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:21,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544489337] [2025-02-08 08:40:21,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:21,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:21,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:21,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:21,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-08 08:40:21,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 08:40:21,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:21,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-08 08:40:21,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:21,915 INFO L124 PetriNetUnfolderBase]: 2536/3865 cut-off events. [2025-02-08 08:40:21,915 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:40:21,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7742 conditions, 3865 events. 2536/3865 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 24957 event pairs, 2534 based on Foata normal form. 1/2051 useless extension candidates. Maximal degree in co-relation 7722. Up to 3784 conditions per place. [2025-02-08 08:40:21,944 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 38 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2025-02-08 08:40:21,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 211 flow [2025-02-08 08:40:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-02-08 08:40:21,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2025-02-08 08:40:21,947 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 121 flow. Second operand 4 states and 94 transitions. [2025-02-08 08:40:21,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 211 flow [2025-02-08 08:40:21,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:21,950 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 136 flow [2025-02-08 08:40:21,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-02-08 08:40:21,951 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2025-02-08 08:40:21,952 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 136 flow [2025-02-08 08:40:21,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 08:40:21,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:21,952 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:40:21,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:40:21,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:21,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash 658835049, now seen corresponding path program 1 times [2025-02-08 08:40:21,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:21,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-02-08 08:40:21,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:21,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:21,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:21,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:21,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-02-08 08:40:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506386721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890222906] [2025-02-08 08:40:22,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:22,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:22,217 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-08 08:40:22,219 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-08 08:40:22,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:22,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:22,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:22,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:22,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:40:22,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:22,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-08 08:40:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:22,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890222906] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:22,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:40:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897805888] [2025-02-08 08:40:22,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:22,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:22,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:22,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:22,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 136 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-08 08:40:22,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:22,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:22,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:23,379 INFO L124 PetriNetUnfolderBase]: 2537/3866 cut-off events. [2025-02-08 08:40:23,379 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 08:40:23,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7760 conditions, 3866 events. 2537/3866 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 24959 event pairs, 2534 based on Foata normal form. 0/2053 useless extension candidates. Maximal degree in co-relation 7727. Up to 3784 conditions per place. [2025-02-08 08:40:23,444 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 35 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2025-02-08 08:40:23,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 237 flow [2025-02-08 08:40:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:40:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:40:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2025-02-08 08:40:23,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2905982905982906 [2025-02-08 08:40:23,447 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 136 flow. Second operand 9 states and 136 transitions. [2025-02-08 08:40:23,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 237 flow [2025-02-08 08:40:23,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 228 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:23,449 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 158 flow [2025-02-08 08:40:23,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=158, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-02-08 08:40:23,450 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-02-08 08:40:23,450 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 158 flow [2025-02-08 08:40:23,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-08 08:40:23,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:23,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:40:23,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:40:23,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:23,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:23,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1050947570, now seen corresponding path program 1 times [2025-02-08 08:40:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:23,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789331946] [2025-02-08 08:40:23,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:23,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:23,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:23,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:23,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:23,902 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-08 08:40:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789331946] [2025-02-08 08:40:23,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789331946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628514894] [2025-02-08 08:40:23,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:23,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:23,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:23,905 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-08 08:40:23,907 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-08 08:40:23,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:23,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:23,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:23,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:23,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:40:23,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:23,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:24,101 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:40:24,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-02-08 08:40:24,130 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-08 08:40:24,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:24,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628514894] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:24,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:40:24,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-02-08 08:40:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195616294] [2025-02-08 08:40:24,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:24,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:24,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:24,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:40:24,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:24,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-08 08:40:24,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:24,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:24,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:24,647 INFO L124 PetriNetUnfolderBase]: 2537/3865 cut-off events. [2025-02-08 08:40:24,648 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 08:40:24,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7762 conditions, 3865 events. 2537/3865 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 25026 event pairs, 2534 based on Foata normal form. 1/2053 useless extension candidates. Maximal degree in co-relation 7724. Up to 3786 conditions per place. [2025-02-08 08:40:24,668 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-02-08 08:40:24,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 252 flow [2025-02-08 08:40:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-02-08 08:40:24,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36153846153846153 [2025-02-08 08:40:24,670 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 158 flow. Second operand 5 states and 94 transitions. [2025-02-08 08:40:24,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 252 flow [2025-02-08 08:40:24,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 213 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 08:40:24,672 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 134 flow [2025-02-08 08:40:24,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-02-08 08:40:24,673 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 1 predicate places. [2025-02-08 08:40:24,673 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 134 flow [2025-02-08 08:40:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-08 08:40:24,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:24,673 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:24,681 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-08 08:40:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:24,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:24,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -643278103, now seen corresponding path program 1 times [2025-02-08 08:40:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208722332] [2025-02-08 08:40:24,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:24,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:24,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:24,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:24,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208722332] [2025-02-08 08:40:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208722332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712258551] [2025-02-08 08:40:25,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:25,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:25,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:25,009 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-08 08:40:25,012 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-08 08:40:25,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:25,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:25,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:25,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:25,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:40:25,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:25,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712258551] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:25,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 08:40:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062181559] [2025-02-08 08:40:25,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:25,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:40:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:40:25,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:40:25,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-08 08:40:25,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 134 flow. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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-08 08:40:25,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:25,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-08 08:40:25,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:25,946 INFO L124 PetriNetUnfolderBase]: 5071/7722 cut-off events. [2025-02-08 08:40:25,947 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 08:40:25,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15468 conditions, 7722 events. 5071/7722 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 52943 event pairs, 5068 based on Foata normal form. 1/4170 useless extension candidates. Maximal degree in co-relation 7721. Up to 3782 conditions per place. [2025-02-08 08:40:25,985 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 68 selfloop transitions, 14 changer transitions 0/87 dead transitions. [2025-02-08 08:40:25,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 87 transitions, 391 flow [2025-02-08 08:40:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:40:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:40:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2025-02-08 08:40:25,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43028846153846156 [2025-02-08 08:40:25,987 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 134 flow. Second operand 8 states and 179 transitions. [2025-02-08 08:40:25,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 87 transitions, 391 flow [2025-02-08 08:40:25,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:40:25,989 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 185 flow [2025-02-08 08:40:25,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=185, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-02-08 08:40:25,990 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2025-02-08 08:40:25,991 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 185 flow [2025-02-08 08:40:25,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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-08 08:40:25,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:25,991 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-08 08:40:25,999 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-08 08:40:26,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:26,195 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:26,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1301553330, now seen corresponding path program 2 times [2025-02-08 08:40:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:26,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-02-08 08:40:26,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:26,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:40:26,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:26,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:26,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:40:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-02-08 08:40:26,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130544518] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973249370] [2025-02-08 08:40:26,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:26,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:26,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:26,403 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-08 08:40:26,404 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-08 08:40:26,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:40:26,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:26,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:26,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:26,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:40:26,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:26,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:26,606 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:40:26,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-02-08 08:40:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:26,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973249370] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:26,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-02-08 08:40:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919302034] [2025-02-08 08:40:26,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:26,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:40:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:26,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:40:26,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:40:27,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:27,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 185 flow. Second operand has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 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-08 08:40:27,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:27,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:27,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:28,278 INFO L124 PetriNetUnfolderBase]: 5070/7719 cut-off events. [2025-02-08 08:40:28,278 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 08:40:28,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15478 conditions, 7719 events. 5070/7719 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 52897 event pairs, 5068 based on Foata normal form. 3/4169 useless extension candidates. Maximal degree in co-relation 7719. Up to 3778 conditions per place. [2025-02-08 08:40:28,316 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 64 selfloop transitions, 17 changer transitions 0/85 dead transitions. [2025-02-08 08:40:28,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 416 flow [2025-02-08 08:40:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:40:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:40:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2025-02-08 08:40:28,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35384615384615387 [2025-02-08 08:40:28,320 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 185 flow. Second operand 10 states and 184 transitions. [2025-02-08 08:40:28,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 416 flow [2025-02-08 08:40:28,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 398 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:28,324 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 202 flow [2025-02-08 08:40:28,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2025-02-08 08:40:28,325 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-02-08 08:40:28,327 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 202 flow [2025-02-08 08:40:28,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 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-08 08:40:28,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:28,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:28,335 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-08 08:40:28,532 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,SelfDestructingSolverStorable6 [2025-02-08 08:40:28,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:28,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash 249841103, now seen corresponding path program 1 times [2025-02-08 08:40:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-02-08 08:40:28,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:28,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:28,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:28,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:28,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:28,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:28,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:28,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-02-08 08:40:28,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860231466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:28,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:28,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662790227] [2025-02-08 08:40:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:28,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:28,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:28,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:28,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:28,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:28,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-08 08:40:28,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:28,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:28,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:29,065 INFO L124 PetriNetUnfolderBase]: 3386/5231 cut-off events. [2025-02-08 08:40:29,066 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 08:40:29,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10514 conditions, 5231 events. 3386/5231 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 34211 event pairs, 3384 based on Foata normal form. 0/3081 useless extension candidates. Maximal degree in co-relation 5228. Up to 5098 conditions per place. [2025-02-08 08:40:29,091 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-02-08 08:40:29,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 50 transitions, 288 flow [2025-02-08 08:40:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-02-08 08:40:29,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2025-02-08 08:40:29,093 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 202 flow. Second operand 5 states and 88 transitions. [2025-02-08 08:40:29,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 50 transitions, 288 flow [2025-02-08 08:40:29,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 250 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 08:40:29,095 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 168 flow [2025-02-08 08:40:29,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-02-08 08:40:29,095 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2025-02-08 08:40:29,095 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 168 flow [2025-02-08 08:40:29,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-08 08:40:29,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:29,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:29,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:40:29,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:29,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash 249841104, now seen corresponding path program 1 times [2025-02-08 08:40:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-02-08 08:40:29,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:29,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:29,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:29,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:29,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-02-08 08:40:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911373916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136873959] [2025-02-08 08:40:29,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:29,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:29,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:29,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:29,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:40:29,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:29,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:29,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:29,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:29,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:40:29,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:29,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:40:29,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:40:29,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 08:40:29,455 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:40:29,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:40:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:29,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:29,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-08 08:40:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136873959] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:29,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:40:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694015144] [2025-02-08 08:40:29,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:29,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:40:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:29,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:40:29,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:40:29,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:29,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 168 flow. Second operand has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 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-08 08:40:29,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:29,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:29,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:30,470 INFO L124 PetriNetUnfolderBase]: 2896/4483 cut-off events. [2025-02-08 08:40:30,470 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 08:40:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9018 conditions, 4483 events. 2896/4483 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 27028 event pairs, 1358 based on Foata normal form. 0/2825 useless extension candidates. Maximal degree in co-relation 4496. Up to 2872 conditions per place. [2025-02-08 08:40:30,494 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 53 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2025-02-08 08:40:30,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 336 flow [2025-02-08 08:40:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:40:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:40:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2025-02-08 08:40:30,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-02-08 08:40:30,496 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 168 flow. Second operand 8 states and 136 transitions. [2025-02-08 08:40:30,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 336 flow [2025-02-08 08:40:30,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:40:30,498 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 178 flow [2025-02-08 08:40:30,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=178, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2025-02-08 08:40:30,499 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2025-02-08 08:40:30,499 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 178 flow [2025-02-08 08:40:30,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 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-08 08:40:30,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:30,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:30,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:40:30,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:30,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:30,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash 249841105, now seen corresponding path program 1 times [2025-02-08 08:40:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:30,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-02-08 08:40:30,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:30,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:30,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:30,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:30,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:30,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:30,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-02-08 08:40:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752789115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:30,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340651584] [2025-02-08 08:40:30,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:30,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:30,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:30,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:30,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 08:40:30,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:30,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:30,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:31,010 INFO L124 PetriNetUnfolderBase]: 1762/2803 cut-off events. [2025-02-08 08:40:31,010 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2025-02-08 08:40:31,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 2803 events. 1762/2803 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16794 event pairs, 1760 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 2983. Up to 2710 conditions per place. [2025-02-08 08:40:31,021 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 39 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-02-08 08:40:31,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 46 transitions, 256 flow [2025-02-08 08:40:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-02-08 08:40:31,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3557692307692308 [2025-02-08 08:40:31,023 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 178 flow. Second operand 4 states and 74 transitions. [2025-02-08 08:40:31,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 46 transitions, 256 flow [2025-02-08 08:40:31,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 46 transitions, 240 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:31,027 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 162 flow [2025-02-08 08:40:31,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2025-02-08 08:40:31,028 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-02-08 08:40:31,028 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 162 flow [2025-02-08 08:40:31,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 08:40:31,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:31,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:31,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:40:31,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:31,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 249841106, now seen corresponding path program 1 times [2025-02-08 08:40:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-02-08 08:40:31,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:31,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:31,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:31,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:31,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:31,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-02-08 08:40:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10230809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734357454] [2025-02-08 08:40:31,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:31,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:31,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:31,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:40:31,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:31,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:31,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:31,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:40:31,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:31,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:31,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734357454] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:40:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-02-08 08:40:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631968814] [2025-02-08 08:40:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:40:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:31,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:40:31,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:40:31,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-08 08:40:31,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-08 08:40:31,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:31,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-08 08:40:31,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:31,744 INFO L124 PetriNetUnfolderBase]: 1402/2397 cut-off events. [2025-02-08 08:40:31,744 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 08:40:31,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 2397 events. 1402/2397 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15243 event pairs, 680 based on Foata normal form. 0/1900 useless extension candidates. Maximal degree in co-relation 2333. Up to 1114 conditions per place. [2025-02-08 08:40:31,755 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 47 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2025-02-08 08:40:31,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 314 flow [2025-02-08 08:40:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-02-08 08:40:31,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2025-02-08 08:40:31,757 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 162 flow. Second operand 6 states and 122 transitions. [2025-02-08 08:40:31,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 314 flow [2025-02-08 08:40:31,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:31,759 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 176 flow [2025-02-08 08:40:31,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-02-08 08:40:31,760 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-02-08 08:40:31,760 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 176 flow [2025-02-08 08:40:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-08 08:40:31,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:31,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:31,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:40:31,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:40:31,965 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:31,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash -429362315, now seen corresponding path program 1 times [2025-02-08 08:40:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293046752] [2025-02-08 08:40:31,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:31,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:31,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:40:31,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:40:31,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:31,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293046752] [2025-02-08 08:40:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293046752] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723098854] [2025-02-08 08:40:32,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:32,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:32,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:32,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:32,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:40:32,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:40:32,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:40:32,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:32,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:32,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:40:32,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:32,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:32,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723098854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:32,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:32,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 08:40:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657891642] [2025-02-08 08:40:32,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:32,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:40:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:32,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:40:32,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:40:32,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-02-08 08:40:32,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 176 flow. Second operand has 14 states, 14 states have (on average 13.071428571428571) internal successors, (183), 14 states have internal predecessors, (183), 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-08 08:40:32,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:32,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-02-08 08:40:32,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:32,660 INFO L124 PetriNetUnfolderBase]: 1152/1861 cut-off events. [2025-02-08 08:40:32,660 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-02-08 08:40:32,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 1861 events. 1152/1861 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9653 event pairs, 1025 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 2829. Up to 1281 conditions per place. [2025-02-08 08:40:32,668 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 58 selfloop transitions, 15 changer transitions 2/78 dead transitions. [2025-02-08 08:40:32,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 414 flow [2025-02-08 08:40:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:40:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:40:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2025-02-08 08:40:32,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37393162393162394 [2025-02-08 08:40:32,670 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 176 flow. Second operand 9 states and 175 transitions. [2025-02-08 08:40:32,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 414 flow [2025-02-08 08:40:32,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 386 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:32,673 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 201 flow [2025-02-08 08:40:32,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2025-02-08 08:40:32,675 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2025-02-08 08:40:32,676 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 201 flow [2025-02-08 08:40:32,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.071428571428571) internal successors, (183), 14 states have internal predecessors, (183), 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-08 08:40:32,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:32,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:32,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:32,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash -339414083, now seen corresponding path program 1 times [2025-02-08 08:40:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-02-08 08:40:32,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:32,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:32,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:40:32,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:32,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:32,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-02-08 08:40:33,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372130691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:33,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213141392] [2025-02-08 08:40:33,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:33,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:33,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:33,122 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:33,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:40:33,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:40:33,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:33,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:33,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:33,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:40:33,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:33,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:40:33,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:40:33,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 08:40:33,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:40:33,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:40:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:33,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:33,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213141392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-02-08 08:40:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83286279] [2025-02-08 08:40:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:33,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:40:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:33,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:40:33,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:40:33,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:33,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 201 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-08 08:40:33,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:33,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:33,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:33,630 INFO L124 PetriNetUnfolderBase]: 863/1498 cut-off events. [2025-02-08 08:40:33,631 INFO L125 PetriNetUnfolderBase]: For 429/448 co-relation queries the response was YES. [2025-02-08 08:40:33,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 1498 events. 863/1498 cut-off events. For 429/448 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8149 event pairs, 369 based on Foata normal form. 0/1304 useless extension candidates. Maximal degree in co-relation 2100. Up to 741 conditions per place. [2025-02-08 08:40:33,636 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 48 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2025-02-08 08:40:33,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 349 flow [2025-02-08 08:40:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-02-08 08:40:33,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32371794871794873 [2025-02-08 08:40:33,638 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 201 flow. Second operand 6 states and 101 transitions. [2025-02-08 08:40:33,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 349 flow [2025-02-08 08:40:33,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 324 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:33,641 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 188 flow [2025-02-08 08:40:33,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2025-02-08 08:40:33,642 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2025-02-08 08:40:33,642 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 188 flow [2025-02-08 08:40:33,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-08 08:40:33,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:33,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:33,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:40:33,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:33,846 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:33,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash -339414081, now seen corresponding path program 1 times [2025-02-08 08:40:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-02-08 08:40:33,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:33,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:33,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:40:33,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:33,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:33,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-02-08 08:40:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980326773] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563124148] [2025-02-08 08:40:34,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:34,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:34,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:40:34,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:40:34,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:34,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:34,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:34,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:40:34,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:34,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:34,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-02-08 08:40:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563124148] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:34,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-08 08:40:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088708645] [2025-02-08 08:40:34,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:34,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:40:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:34,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:40:34,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:40:34,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-08 08:40:34,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 188 flow. Second operand has 20 states, 20 states have (on average 14.1) internal successors, (282), 20 states have internal predecessors, (282), 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-08 08:40:34,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:34,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-08 08:40:34,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:35,353 INFO L124 PetriNetUnfolderBase]: 811/1391 cut-off events. [2025-02-08 08:40:35,353 INFO L125 PetriNetUnfolderBase]: For 441/486 co-relation queries the response was YES. [2025-02-08 08:40:35,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3245 conditions, 1391 events. 811/1391 cut-off events. For 441/486 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7443 event pairs, 541 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 2161. Up to 758 conditions per place. [2025-02-08 08:40:35,359 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 63 selfloop transitions, 16 changer transitions 7/90 dead transitions. [2025-02-08 08:40:35,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 490 flow [2025-02-08 08:40:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:40:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 08:40:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 267 transitions. [2025-02-08 08:40:35,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3423076923076923 [2025-02-08 08:40:35,361 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 188 flow. Second operand 15 states and 267 transitions. [2025-02-08 08:40:35,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 490 flow [2025-02-08 08:40:35,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:35,365 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 220 flow [2025-02-08 08:40:35,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=220, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2025-02-08 08:40:35,366 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2025-02-08 08:40:35,366 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 220 flow [2025-02-08 08:40:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.1) internal successors, (282), 20 states have internal predecessors, (282), 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-08 08:40:35,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:35,367 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:35,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:40:35,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:35,568 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:35,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash -851133385, now seen corresponding path program 1 times [2025-02-08 08:40:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:35,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187144602] [2025-02-08 08:40:35,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:35,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:40:35,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:35,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:35,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:40:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187144602] [2025-02-08 08:40:35,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187144602] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605936155] [2025-02-08 08:40:35,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:35,810 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:35,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:40:35,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:40:35,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:35,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:35,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:40:35,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:35,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:40:36,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:40:36,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605936155] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:36,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:40:36,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 18 [2025-02-08 08:40:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752946461] [2025-02-08 08:40:36,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:36,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:40:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:36,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:40:36,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:40:36,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-08 08:40:36,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 48 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-08 08:40:36,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:36,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-08 08:40:36,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:36,382 INFO L124 PetriNetUnfolderBase]: 654/1160 cut-off events. [2025-02-08 08:40:36,383 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2025-02-08 08:40:36,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2925 conditions, 1160 events. 654/1160 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5995 event pairs, 272 based on Foata normal form. 0/1104 useless extension candidates. Maximal degree in co-relation 1985. Up to 574 conditions per place. [2025-02-08 08:40:36,387 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 45 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2025-02-08 08:40:36,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 61 transitions, 383 flow [2025-02-08 08:40:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-02-08 08:40:36,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2025-02-08 08:40:36,389 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 220 flow. Second operand 6 states and 116 transitions. [2025-02-08 08:40:36,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 61 transitions, 383 flow [2025-02-08 08:40:36,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 358 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 08:40:36,393 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 217 flow [2025-02-08 08:40:36,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2025-02-08 08:40:36,393 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2025-02-08 08:40:36,393 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 217 flow [2025-02-08 08:40:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-08 08:40:36,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:36,394 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:36,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:40:36,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 08:40:36,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:36,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -851133387, now seen corresponding path program 2 times [2025-02-08 08:40:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-02-08 08:40:36,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:36,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:40:36,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:36,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:36,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-02-08 08:40:36,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27763768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509689121] [2025-02-08 08:40:36,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:36,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:36,872 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:36,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:40:36,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:40:36,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:36,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:36,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:40:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:36,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:40:37,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:40:37,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 08:40:37,040 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:40:37,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:40:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:37,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:37,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-08 08:40:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509689121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:37,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:37,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2025-02-08 08:40:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647540997] [2025-02-08 08:40:37,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:37,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:40:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:37,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:40:37,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:40:37,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2025-02-08 08:40:37,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 217 flow. Second operand has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 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-08 08:40:37,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:37,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2025-02-08 08:40:37,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:38,052 INFO L124 PetriNetUnfolderBase]: 549/992 cut-off events. [2025-02-08 08:40:38,052 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-02-08 08:40:38,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 992 events. 549/992 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5015 event pairs, 272 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1725. Up to 316 conditions per place. [2025-02-08 08:40:38,055 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 58 selfloop transitions, 14 changer transitions 4/80 dead transitions. [2025-02-08 08:40:38,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 466 flow [2025-02-08 08:40:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:40:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 08:40:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 217 transitions. [2025-02-08 08:40:38,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2980769230769231 [2025-02-08 08:40:38,057 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 217 flow. Second operand 14 states and 217 transitions. [2025-02-08 08:40:38,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 466 flow [2025-02-08 08:40:38,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:38,061 INFO L231 Difference]: Finished difference. Result has 77 places, 45 transitions, 215 flow [2025-02-08 08:40:38,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=215, PETRI_PLACES=77, PETRI_TRANSITIONS=45} [2025-02-08 08:40:38,062 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2025-02-08 08:40:38,062 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 45 transitions, 215 flow [2025-02-08 08:40:38,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 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-08 08:40:38,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:38,063 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:38,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 08:40:38,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:38,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1934488449, now seen corresponding path program 2 times [2025-02-08 08:40:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-02-08 08:40:38,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:38,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 08:40:38,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:40:38,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:38,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:40:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-02-08 08:40:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156491126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201652749] [2025-02-08 08:40:38,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:38,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:38,438 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:38,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 08:40:38,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 08:40:38,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:40:38,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:38,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 08:40:38,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:38,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201652749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:39,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 23 [2025-02-08 08:40:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487168638] [2025-02-08 08:40:39,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:39,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 08:40:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:39,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 08:40:39,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-02-08 08:40:39,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2025-02-08 08:40:39,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 45 transitions, 215 flow. Second operand has 24 states, 24 states have (on average 11.208333333333334) internal successors, (269), 24 states have internal predecessors, (269), 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-08 08:40:39,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:39,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2025-02-08 08:40:39,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:40,230 INFO L124 PetriNetUnfolderBase]: 1143/1923 cut-off events. [2025-02-08 08:40:40,231 INFO L125 PetriNetUnfolderBase]: For 1388/1491 co-relation queries the response was YES. [2025-02-08 08:40:40,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1923 events. 1143/1923 cut-off events. For 1388/1491 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10215 event pairs, 603 based on Foata normal form. 111/2028 useless extension candidates. Maximal degree in co-relation 3486. Up to 487 conditions per place. [2025-02-08 08:40:40,238 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 79 selfloop transitions, 31 changer transitions 35/148 dead transitions. [2025-02-08 08:40:40,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 148 transitions, 902 flow [2025-02-08 08:40:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 08:40:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 08:40:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 354 transitions. [2025-02-08 08:40:40,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28365384615384615 [2025-02-08 08:40:40,240 INFO L175 Difference]: Start difference. First operand has 77 places, 45 transitions, 215 flow. Second operand 24 states and 354 transitions. [2025-02-08 08:40:40,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 148 transitions, 902 flow [2025-02-08 08:40:40,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 148 transitions, 837 flow, removed 8 selfloop flow, removed 12 redundant places. [2025-02-08 08:40:40,248 INFO L231 Difference]: Finished difference. Result has 87 places, 57 transitions, 339 flow [2025-02-08 08:40:40,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=339, PETRI_PLACES=87, PETRI_TRANSITIONS=57} [2025-02-08 08:40:40,249 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 31 predicate places. [2025-02-08 08:40:40,249 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 57 transitions, 339 flow [2025-02-08 08:40:40,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.208333333333334) internal successors, (269), 24 states have internal predecessors, (269), 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-08 08:40:40,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:40,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:40,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:40,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 08:40:40,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:40,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1769128384, now seen corresponding path program 1 times [2025-02-08 08:40:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:40,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994231956] [2025-02-08 08:40:40,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:40,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:40:40,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:40:40,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:40,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:40:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:40,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994231956] [2025-02-08 08:40:40,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994231956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:40,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:40,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802546258] [2025-02-08 08:40:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:40,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:40,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:40,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:40,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:40,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-08 08:40:40,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 57 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 08:40:40,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:40,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-08 08:40:40,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:40,564 INFO L124 PetriNetUnfolderBase]: 500/935 cut-off events. [2025-02-08 08:40:40,564 INFO L125 PetriNetUnfolderBase]: For 682/724 co-relation queries the response was YES. [2025-02-08 08:40:40,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 935 events. 500/935 cut-off events. For 682/724 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4044 event pairs, 496 based on Foata normal form. 4/938 useless extension candidates. Maximal degree in co-relation 2053. Up to 895 conditions per place. [2025-02-08 08:40:40,567 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2025-02-08 08:40:40,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 55 transitions, 441 flow [2025-02-08 08:40:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-08 08:40:40,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3782051282051282 [2025-02-08 08:40:40,568 INFO L175 Difference]: Start difference. First operand has 87 places, 57 transitions, 339 flow. Second operand 3 states and 59 transitions. [2025-02-08 08:40:40,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 55 transitions, 441 flow [2025-02-08 08:40:40,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 55 transitions, 413 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:40,574 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2025-02-08 08:40:40,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2025-02-08 08:40:40,575 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2025-02-08 08:40:40,575 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2025-02-08 08:40:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 08:40:40,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 33 remaining) [2025-02-08 08:40:40,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 33 remaining) [2025-02-08 08:40:40,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 33 remaining) [2025-02-08 08:40:40,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 33 remaining) [2025-02-08 08:40:40,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 33 remaining) [2025-02-08 08:40:40,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 33 remaining) [2025-02-08 08:40:40,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 33 remaining) [2025-02-08 08:40:40,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 33 remaining) [2025-02-08 08:40:40,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:40:40,579 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:40,585 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:40:40,585 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:40:40,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:40:40 BasicIcfg [2025-02-08 08:40:40,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:40:40,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:40:40,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:40:40,591 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:40:40,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:19" (3/4) ... [2025-02-08 08:40:40,593 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:40:40,595 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:40:40,595 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:40:40,595 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:40:40,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 98 nodes and edges [2025-02-08 08:40:40,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2025-02-08 08:40:40,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 08:40:40,603 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:40:40,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:40:40,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:40:40,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:40:40,687 INFO L158 Benchmark]: Toolchain (without parser) took 23018.91ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 104.6MB in the beginning and 215.5MB in the end (delta: -110.9MB). Peak memory consumption was 334.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:40,687 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:40,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.57ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 92.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:40:40,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:40,689 INFO L158 Benchmark]: Boogie Preprocessor took 63.22ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:40,689 INFO L158 Benchmark]: IcfgBuilder took 1049.49ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 88.2MB in the end (delta: -545.1kB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-02-08 08:40:40,690 INFO L158 Benchmark]: TraceAbstraction took 21471.47ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 87.6MB in the beginning and 219.8MB in the end (delta: -132.2MB). Peak memory consumption was 311.5MB. Max. memory is 16.1GB. [2025-02-08 08:40:40,690 INFO L158 Benchmark]: Witness Printer took 94.47ms. Allocated memory is still 587.2MB. Free memory was 219.8MB in the beginning and 215.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:40,691 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.57ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 92.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.22ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1049.49ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 88.2MB in the end (delta: -545.1kB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21471.47ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 87.6MB in the beginning and 219.8MB in the end (delta: -132.2MB). Peak memory consumption was 311.5MB. Max. memory is 16.1GB. * Witness Printer took 94.47ms. Allocated memory is still 587.2MB. Free memory was 219.8MB in the beginning and 215.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 77]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 33 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.3s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1832 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1683 mSDsluCounter, 895 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 872 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6991 IncrementalHoareTripleChecker+Invalid, 7171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 23 mSDtfsCounter, 6991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=17, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 441 ConstructedInterpolants, 11 QuantifiedInterpolants, 5429 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1746 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 245/344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:40:40,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE