./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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-three-array-sum.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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:13:16,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:13:16,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:13:16,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:13:16,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:13:16,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:13:16,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:13:16,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:13:16,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:13:16,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:13:16,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:13:16,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:13:16,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:13:16,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:13:16,353 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:13:16,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:13:16,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:13:16,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:13:16,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:16,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:16,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:16,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:16,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:13:16,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:16,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:16,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:16,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:13:16,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:13:16,357 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-01-10 01:13:16,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:13:16,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:13:16,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:13:16,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:13:16,559 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:13:16,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-01-10 01:13:17,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c76800b12/a24b799547f245359265890762ab7c3a/FLAG04b7ed446 [2025-01-10 01:13:17,905 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:13:17,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-01-10 01:13:17,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c76800b12/a24b799547f245359265890762ab7c3a/FLAG04b7ed446 [2025-01-10 01:13:17,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c76800b12/a24b799547f245359265890762ab7c3a [2025-01-10 01:13:17,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:13:17,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:13:17,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:17,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:13:17,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:13:17,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382b6168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:17, skipping insertion in model container [2025-01-10 01:13:17,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:17" (1/1) ... [2025-01-10 01:13:17,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:13:18,086 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:13:18,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:18,101 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:13:18,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:18,126 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:13:18,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18 WrapperNode [2025-01-10 01:13:18,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:18,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:18,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:13:18,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:13:18,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,154 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 131 [2025-01-10 01:13:18,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:18,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:13:18,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:13:18,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:13:18,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,173 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 01:13:18,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:13:18,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:13:18,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:13:18,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:13:18,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (1/1) ... [2025-01-10 01:13:18,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:18,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:18,213 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-01-10 01:13:18,215 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-01-10 01:13:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:13:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:13:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:13:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:13:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:13:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:13:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:13:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:13:18,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:13:18,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:13:18,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:13:18,236 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:13:18,347 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:13:18,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:13:18,690 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:13:18,691 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:13:18,905 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:13:18,905 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:13:18,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:18 BoogieIcfgContainer [2025-01-10 01:13:18,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:13:18,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:13:18,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:13:18,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:13:18,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:13:17" (1/3) ... [2025-01-10 01:13:18,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eec288c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:18, skipping insertion in model container [2025-01-10 01:13:18,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:18" (2/3) ... [2025-01-10 01:13:18,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eec288c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:18, skipping insertion in model container [2025-01-10 01:13:18,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:18" (3/3) ... [2025-01-10 01:13:18,914 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-01-10 01:13:18,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:13:18,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 58 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-01-10 01:13:18,924 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:13:18,975 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:13:18,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 64 transitions, 149 flow [2025-01-10 01:13:19,056 INFO L124 PetriNetUnfolderBase]: 7/61 cut-off events. [2025-01-10 01:13:19,059 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:13:19,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 7/61 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 150 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-01-10 01:13:19,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 64 transitions, 149 flow [2025-01-10 01:13:19,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 60 transitions, 138 flow [2025-01-10 01:13:19,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:13:19,090 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;@7b695f5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:13:19,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-10 01:13:19,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:13:19,093 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:13:19,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:13:19,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:19,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:19,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:19,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash 567705, now seen corresponding path program 1 times [2025-01-10 01:13:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:19,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216772910] [2025-01-10 01:13:19,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:19,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:19,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:19,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:19,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:19,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216772910] [2025-01-10 01:13:19,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216772910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:19,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:13:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046084227] [2025-01-10 01:13:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:19,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:19,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:19,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:19,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:19,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:13:19,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-01-10 01:13:19,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:19,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:13:19,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:19,728 INFO L124 PetriNetUnfolderBase]: 1638/2510 cut-off events. [2025-01-10 01:13:19,728 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-10 01:13:19,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4925 conditions, 2510 events. 1638/2510 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 13962 event pairs, 1286 based on Foata normal form. 1/1824 useless extension candidates. Maximal degree in co-relation 4374. Up to 2234 conditions per place. [2025-01-10 01:13:19,753 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 38 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-01-10 01:13:19,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 208 flow [2025-01-10 01:13:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-01-10 01:13:19,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2025-01-10 01:13:19,762 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 138 flow. Second operand 3 states and 101 transitions. [2025-01-10 01:13:19,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 208 flow [2025-01-10 01:13:19,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:19,770 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 120 flow [2025-01-10 01:13:19,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2025-01-10 01:13:19,774 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2025-01-10 01:13:19,774 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 120 flow [2025-01-10 01:13:19,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-01-10 01:13:19,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:19,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:19,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:13:19,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:19,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash 567706, now seen corresponding path program 1 times [2025-01-10 01:13:19,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:19,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017608647] [2025-01-10 01:13:19,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:19,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:19,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017608647] [2025-01-10 01:13:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017608647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514151610] [2025-01-10 01:13:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:20,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:20,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:20,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:20,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:13:20,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 01:13:20,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:20,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:13:20,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:20,395 INFO L124 PetriNetUnfolderBase]: 1638/2509 cut-off events. [2025-01-10 01:13:20,396 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-10 01:13:20,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 2509 events. 1638/2509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 13963 event pairs, 1286 based on Foata normal form. 0/1821 useless extension candidates. Maximal degree in co-relation 4774. Up to 2242 conditions per place. [2025-01-10 01:13:20,418 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 38 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-10 01:13:20,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 202 flow [2025-01-10 01:13:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-01-10 01:13:20,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46484375 [2025-01-10 01:13:20,421 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 120 flow. Second operand 4 states and 119 transitions. [2025-01-10 01:13:20,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 202 flow [2025-01-10 01:13:20,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:20,423 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 122 flow [2025-01-10 01:13:20,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2025-01-10 01:13:20,424 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2025-01-10 01:13:20,424 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 122 flow [2025-01-10 01:13:20,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 01:13:20,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:20,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:13:20,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:13:20,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:20,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash 17600215, now seen corresponding path program 1 times [2025-01-10 01:13:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328183809] [2025-01-10 01:13:20,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:20,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:13:20,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:13:20,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:20,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328183809] [2025-01-10 01:13:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328183809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:20,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:20,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:20,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933590657] [2025-01-10 01:13:20,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:20,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:20,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:20,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:20,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:20,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:13:20,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-01-10 01:13:20,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:20,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:13:20,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:20,807 INFO L124 PetriNetUnfolderBase]: 1641/2522 cut-off events. [2025-01-10 01:13:20,807 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-10 01:13:20,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4830 conditions, 2522 events. 1641/2522 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 14057 event pairs, 1286 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 4778. Up to 2245 conditions per place. [2025-01-10 01:13:20,819 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 41 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-01-10 01:13:20,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 252 flow [2025-01-10 01:13:20,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 01:13:20,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55078125 [2025-01-10 01:13:20,822 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 122 flow. Second operand 4 states and 141 transitions. [2025-01-10 01:13:20,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 252 flow [2025-01-10 01:13:20,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 238 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:20,825 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 176 flow [2025-01-10 01:13:20,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2025-01-10 01:13:20,826 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-01-10 01:13:20,827 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 176 flow [2025-01-10 01:13:20,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-01-10 01:13:20,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:20,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:13:20,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:13:20,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:20,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash -266779975, now seen corresponding path program 1 times [2025-01-10 01:13:20,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:20,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880716621] [2025-01-10 01:13:20,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:20,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:20,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:20,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:20,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880716621] [2025-01-10 01:13:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880716621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791926369] [2025-01-10 01:13:21,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:21,012 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-01-10 01:13:21,014 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-01-10 01:13:21,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:21,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:21,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:21,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:21,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:13:21,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:21,109 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-01-10 01:13:21,204 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:13:21,205 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-01-10 01:13:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:21,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791926369] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:21,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:21,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-01-10 01:13:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085568541] [2025-01-10 01:13:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:21,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:21,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:13:21,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:13:21,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-01-10 01:13:21,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:21,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:13:21,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:21,769 INFO L124 PetriNetUnfolderBase]: 3275/5018 cut-off events. [2025-01-10 01:13:21,769 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 01:13:21,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9629 conditions, 5018 events. 3275/5018 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 31221 event pairs, 2572 based on Foata normal form. 2/3658 useless extension candidates. Maximal degree in co-relation 4781. Up to 2246 conditions per place. [2025-01-10 01:13:21,794 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 75 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-01-10 01:13:21,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 425 flow [2025-01-10 01:13:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-01-10 01:13:21,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-10 01:13:21,796 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 176 flow. Second operand 5 states and 180 transitions. [2025-01-10 01:13:21,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 425 flow [2025-01-10 01:13:21,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:13:21,797 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 209 flow [2025-01-10 01:13:21,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2025-01-10 01:13:21,798 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2025-01-10 01:13:21,798 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 209 flow [2025-01-10 01:13:21,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-01-10 01:13:21,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:21,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:21,805 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-01-10 01:13:22,003 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-01-10 01:13:22,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:22,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1322499544, now seen corresponding path program 1 times [2025-01-10 01:13:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678021638] [2025-01-10 01:13:22,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:22,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:13:22,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:13:22,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:22,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:22,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:22,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678021638] [2025-01-10 01:13:22,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678021638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:22,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065314700] [2025-01-10 01:13:22,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:22,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:22,093 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-01-10 01:13:22,094 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-01-10 01:13:22,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:13:22,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:13:22,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:22,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:22,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:13:22,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:22,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065314700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:22,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:13:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129795863] [2025-01-10 01:13:22,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:22,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:13:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:22,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:13:22,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:13:22,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:13:22,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 209 flow. Second operand has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 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-01-10 01:13:22,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:22,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:13:22,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:23,034 INFO L124 PetriNetUnfolderBase]: 4914/7534 cut-off events. [2025-01-10 01:13:23,034 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 01:13:23,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14485 conditions, 7534 events. 4914/7534 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 46178 event pairs, 3858 based on Foata normal form. 2/5490 useless extension candidates. Maximal degree in co-relation 4807. Up to 4470 conditions per place. [2025-01-10 01:13:23,068 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 70 selfloop transitions, 29 changer transitions 0/113 dead transitions. [2025-01-10 01:13:23,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 113 transitions, 575 flow [2025-01-10 01:13:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 298 transitions. [2025-01-10 01:13:23,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2025-01-10 01:13:23,070 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 209 flow. Second operand 9 states and 298 transitions. [2025-01-10 01:13:23,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 113 transitions, 575 flow [2025-01-10 01:13:23,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 113 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:23,072 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 377 flow [2025-01-10 01:13:23,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2025-01-10 01:13:23,073 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2025-01-10 01:13:23,073 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 377 flow [2025-01-10 01:13:23,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 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-01-10 01:13:23,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:23,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:23,080 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-01-10 01:13:23,278 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-01-10 01:13:23,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:23,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2095359515, now seen corresponding path program 1 times [2025-01-10 01:13:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914805888] [2025-01-10 01:13:23,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:23,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:23,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:13:23,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:13:23,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:23,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:23,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914805888] [2025-01-10 01:13:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914805888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:13:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653488859] [2025-01-10 01:13:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:23,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:23,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:23,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:13:23,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-01-10 01:13:23,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:23,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:13:23,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:23,966 INFO L124 PetriNetUnfolderBase]: 6284/9755 cut-off events. [2025-01-10 01:13:23,966 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-01-10 01:13:23,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18791 conditions, 9755 events. 6284/9755 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 63750 event pairs, 4088 based on Foata normal form. 0/6711 useless extension candidates. Maximal degree in co-relation 6869. Up to 5493 conditions per place. [2025-01-10 01:13:24,002 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 97 selfloop transitions, 20 changer transitions 0/130 dead transitions. [2025-01-10 01:13:24,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 130 transitions, 737 flow [2025-01-10 01:13:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2025-01-10 01:13:24,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-01-10 01:13:24,005 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 377 flow. Second operand 6 states and 228 transitions. [2025-01-10 01:13:24,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 130 transitions, 737 flow [2025-01-10 01:13:24,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 663 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:24,009 INFO L231 Difference]: Finished difference. Result has 73 places, 80 transitions, 361 flow [2025-01-10 01:13:24,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=73, PETRI_TRANSITIONS=80} [2025-01-10 01:13:24,010 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2025-01-10 01:13:24,010 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 80 transitions, 361 flow [2025-01-10 01:13:24,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-01-10 01:13:24,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:24,011 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:13:24,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:13:24,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:24,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1094733638, now seen corresponding path program 2 times [2025-01-10 01:13:24,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:24,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995638438] [2025-01-10 01:13:24,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:24,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:13:24,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:13:24,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:24,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995638438] [2025-01-10 01:13:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995638438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345115651] [2025-01-10 01:13:24,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:24,325 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-01-10 01:13:24,326 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-01-10 01:13:24,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:13:24,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:13:24,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:24,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:24,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:13:24,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:24,509 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-01-10 01:13:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:24,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345115651] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:24,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 01:13:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455774405] [2025-01-10 01:13:24,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:24,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:13:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:24,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:13:24,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:25,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:13:25,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 80 transitions, 361 flow. Second operand has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:25,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:25,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:13:25,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:25,908 INFO L124 PetriNetUnfolderBase]: 5620/9907 cut-off events. [2025-01-10 01:13:25,908 INFO L125 PetriNetUnfolderBase]: For 2251/2291 co-relation queries the response was YES. [2025-01-10 01:13:25,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20137 conditions, 9907 events. 5620/9907 cut-off events. For 2251/2291 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 76593 event pairs, 4644 based on Foata normal form. 4/6960 useless extension candidates. Maximal degree in co-relation 8041. Up to 7803 conditions per place. [2025-01-10 01:13:25,960 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 36 selfloop transitions, 33 changer transitions 0/81 dead transitions. [2025-01-10 01:13:25,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 511 flow [2025-01-10 01:13:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:13:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:13:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2025-01-10 01:13:25,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-01-10 01:13:25,962 INFO L175 Difference]: Start difference. First operand has 73 places, 80 transitions, 361 flow. Second operand 7 states and 184 transitions. [2025-01-10 01:13:25,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 511 flow [2025-01-10 01:13:25,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 467 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:25,971 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 395 flow [2025-01-10 01:13:25,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2025-01-10 01:13:25,971 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2025-01-10 01:13:25,971 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 395 flow [2025-01-10 01:13:25,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:25,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:25,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:25,980 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-01-10 01:13:26,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:26,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:26,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash -749937044, now seen corresponding path program 1 times [2025-01-10 01:13:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837799232] [2025-01-10 01:13:26,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:26,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:13:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:13:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:26,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837799232] [2025-01-10 01:13:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837799232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:26,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:13:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456573315] [2025-01-10 01:13:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:26,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:26,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:26,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:26,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:13:26,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-01-10 01:13:26,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:26,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:13:26,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:26,713 INFO L124 PetriNetUnfolderBase]: 4182/6493 cut-off events. [2025-01-10 01:13:26,713 INFO L125 PetriNetUnfolderBase]: For 1315/1643 co-relation queries the response was YES. [2025-01-10 01:13:26,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13632 conditions, 6493 events. 4182/6493 cut-off events. For 1315/1643 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 36725 event pairs, 3158 based on Foata normal form. 0/4820 useless extension candidates. Maximal degree in co-relation 5602. Up to 4925 conditions per place. [2025-01-10 01:13:26,737 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 80 selfloop transitions, 20 changer transitions 0/111 dead transitions. [2025-01-10 01:13:26,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 671 flow [2025-01-10 01:13:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-01-10 01:13:26,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5494791666666666 [2025-01-10 01:13:26,738 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 395 flow. Second operand 6 states and 211 transitions. [2025-01-10 01:13:26,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 671 flow [2025-01-10 01:13:26,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 643 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:26,742 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 425 flow [2025-01-10 01:13:26,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2025-01-10 01:13:26,742 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2025-01-10 01:13:26,742 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 425 flow [2025-01-10 01:13:26,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-01-10 01:13:26,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:26,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:26,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:13:26,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1553301054, now seen corresponding path program 1 times [2025-01-10 01:13:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735227174] [2025-01-10 01:13:26,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:26,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:13:26,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:13:26,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:26,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735227174] [2025-01-10 01:13:26,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735227174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:26,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:26,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610386663] [2025-01-10 01:13:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:26,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:26,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:26,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:26,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:26,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-01-10 01:13:26,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 425 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-01-10 01:13:26,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:26,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-01-10 01:13:26,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:27,151 INFO L124 PetriNetUnfolderBase]: 3366/5176 cut-off events. [2025-01-10 01:13:27,151 INFO L125 PetriNetUnfolderBase]: For 1439/1699 co-relation queries the response was YES. [2025-01-10 01:13:27,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11522 conditions, 5176 events. 3366/5176 cut-off events. For 1439/1699 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 30326 event pairs, 2747 based on Foata normal form. 0/3997 useless extension candidates. Maximal degree in co-relation 6408. Up to 4680 conditions per place. [2025-01-10 01:13:27,164 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 59 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-01-10 01:13:27,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 561 flow [2025-01-10 01:13:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-10 01:13:27,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.409375 [2025-01-10 01:13:27,165 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 425 flow. Second operand 5 states and 131 transitions. [2025-01-10 01:13:27,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 561 flow [2025-01-10 01:13:27,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 529 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:27,169 INFO L231 Difference]: Finished difference. Result has 77 places, 81 transitions, 411 flow [2025-01-10 01:13:27,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=77, PETRI_TRANSITIONS=81} [2025-01-10 01:13:27,170 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 14 predicate places. [2025-01-10 01:13:27,170 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 81 transitions, 411 flow [2025-01-10 01:13:27,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-01-10 01:13:27,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:27,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:27,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:13:27,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -462445281, now seen corresponding path program 1 times [2025-01-10 01:13:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829170032] [2025-01-10 01:13:27,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:27,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:13:27,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:13:27,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:27,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829170032] [2025-01-10 01:13:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829170032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624736879] [2025-01-10 01:13:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:27,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:13:27,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 81 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-01-10 01:13:27,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:27,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:13:27,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:27,423 INFO L124 PetriNetUnfolderBase]: 2651/4117 cut-off events. [2025-01-10 01:13:27,424 INFO L125 PetriNetUnfolderBase]: For 1189/1407 co-relation queries the response was YES. [2025-01-10 01:13:27,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9189 conditions, 4117 events. 2651/4117 cut-off events. For 1189/1407 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22780 event pairs, 2114 based on Foata normal form. 0/3378 useless extension candidates. Maximal degree in co-relation 5155. Up to 3655 conditions per place. [2025-01-10 01:13:27,437 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 60 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2025-01-10 01:13:27,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 543 flow [2025-01-10 01:13:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-01-10 01:13:27,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44921875 [2025-01-10 01:13:27,438 INFO L175 Difference]: Start difference. First operand has 77 places, 81 transitions, 411 flow. Second operand 4 states and 115 transitions. [2025-01-10 01:13:27,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 543 flow [2025-01-10 01:13:27,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 79 transitions, 528 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:27,445 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 408 flow [2025-01-10 01:13:27,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=408, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-01-10 01:13:27,446 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2025-01-10 01:13:27,446 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 408 flow [2025-01-10 01:13:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-01-10 01:13:27,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:27,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:13:27,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:13:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1553301055, now seen corresponding path program 1 times [2025-01-10 01:13:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574797542] [2025-01-10 01:13:27,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:27,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:13:27,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:13:27,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:27,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:27,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:27,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574797542] [2025-01-10 01:13:27,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574797542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:27,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297687224] [2025-01-10 01:13:27,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:27,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:27,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:27,712 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-01-10 01:13:27,724 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-01-10 01:13:27,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:13:27,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:13:27,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:27,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:27,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:13:27,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:27,795 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-01-10 01:13:27,805 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-01-10 01:13:27,919 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:13:27,920 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 18 treesize of output 17 [2025-01-10 01:13:27,964 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:27,964 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-01-10 01:13:28,137 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-01-10 01:13:28,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-01-10 01:13:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:28,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:28,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297687224] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:28,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:28,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2025-01-10 01:13:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014661506] [2025-01-10 01:13:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:28,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:13:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:28,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:13:28,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:32,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:36,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:36,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:13:36,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 408 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-01-10 01:13:36,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:36,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:13:36,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:41,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:48,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:52,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:56,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:00,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:04,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:08,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:12,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:12,764 INFO L124 PetriNetUnfolderBase]: 4639/7356 cut-off events. [2025-01-10 01:14:12,765 INFO L125 PetriNetUnfolderBase]: For 2016/2482 co-relation queries the response was YES. [2025-01-10 01:14:12,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15976 conditions, 7356 events. 4639/7356 cut-off events. For 2016/2482 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44916 event pairs, 1898 based on Foata normal form. 0/5596 useless extension candidates. Maximal degree in co-relation 9286. Up to 3805 conditions per place. [2025-01-10 01:14:12,795 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 91 selfloop transitions, 22 changer transitions 0/122 dead transitions. [2025-01-10 01:14:12,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 122 transitions, 758 flow [2025-01-10 01:14:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2025-01-10 01:14:12,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2025-01-10 01:14:12,797 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 408 flow. Second operand 7 states and 218 transitions. [2025-01-10 01:14:12,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 122 transitions, 758 flow [2025-01-10 01:14:12,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 122 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:12,807 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 488 flow [2025-01-10 01:14:12,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=488, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2025-01-10 01:14:12,808 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 18 predicate places. [2025-01-10 01:14:12,808 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 488 flow [2025-01-10 01:14:12,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-01-10 01:14:12,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:12,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:12,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:14:13,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:14:13,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:13,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -462445280, now seen corresponding path program 1 times [2025-01-10 01:14:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:13,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117004117] [2025-01-10 01:14:13,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:13,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:14:13,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:14:13,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:13,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117004117] [2025-01-10 01:14:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117004117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:14:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698068169] [2025-01-10 01:14:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:13,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:13,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:13,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:13,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:13,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:14:13,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 488 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-01-10 01:14:13,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:13,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:14:13,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:13,544 INFO L124 PetriNetUnfolderBase]: 3606/5707 cut-off events. [2025-01-10 01:14:13,544 INFO L125 PetriNetUnfolderBase]: For 7194/8154 co-relation queries the response was YES. [2025-01-10 01:14:13,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14857 conditions, 5707 events. 3606/5707 cut-off events. For 7194/8154 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 33031 event pairs, 2496 based on Foata normal form. 0/4544 useless extension candidates. Maximal degree in co-relation 8140. Up to 4465 conditions per place. [2025-01-10 01:14:13,567 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 75 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2025-01-10 01:14:13,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 104 transitions, 762 flow [2025-01-10 01:14:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2025-01-10 01:14:13,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182291666666666 [2025-01-10 01:14:13,571 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 488 flow. Second operand 6 states and 199 transitions. [2025-01-10 01:14:13,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 104 transitions, 762 flow [2025-01-10 01:14:13,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 104 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:13,577 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 535 flow [2025-01-10 01:14:13,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-01-10 01:14:13,579 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 24 predicate places. [2025-01-10 01:14:13,579 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 535 flow [2025-01-10 01:14:13,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-01-10 01:14:13,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:13,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:14:13,580 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 907693062, now seen corresponding path program 1 times [2025-01-10 01:14:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54949614] [2025-01-10 01:14:13,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:13,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:14:13,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:14:13,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:13,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:13,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:13,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54949614] [2025-01-10 01:14:13,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54949614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:13,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:14:13,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350316118] [2025-01-10 01:14:13,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:13,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:13,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:13,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:13,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-01-10 01:14:13,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-01-10 01:14:13,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:13,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-01-10 01:14:13,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:13,958 INFO L124 PetriNetUnfolderBase]: 2786/4751 cut-off events. [2025-01-10 01:14:13,958 INFO L125 PetriNetUnfolderBase]: For 5704/6240 co-relation queries the response was YES. [2025-01-10 01:14:13,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12449 conditions, 4751 events. 2786/4751 cut-off events. For 5704/6240 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 28925 event pairs, 1992 based on Foata normal form. 172/4221 useless extension candidates. Maximal degree in co-relation 7249. Up to 3757 conditions per place. [2025-01-10 01:14:13,972 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 58 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2025-01-10 01:14:13,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 675 flow [2025-01-10 01:14:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-10 01:14:13,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-10 01:14:13,973 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 535 flow. Second operand 5 states and 128 transitions. [2025-01-10 01:14:13,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 675 flow [2025-01-10 01:14:13,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 643 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:13,978 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 527 flow [2025-01-10 01:14:13,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2025-01-10 01:14:13,978 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 23 predicate places. [2025-01-10 01:14:13,979 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 527 flow [2025-01-10 01:14:13,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-01-10 01:14:13,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:13,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:13,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:14:13,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:13,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 907693063, now seen corresponding path program 1 times [2025-01-10 01:14:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919821335] [2025-01-10 01:14:13,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:13,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:14:13,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:14:13,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:13,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919821335] [2025-01-10 01:14:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919821335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:14,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657091339] [2025-01-10 01:14:14,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:14,123 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-01-10 01:14:14,130 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-01-10 01:14:14,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:14:14,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:14:14,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:14,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:14,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:14:14,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:14,194 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-01-10 01:14:14,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:14:14,223 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-01-10 01:14:14,228 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:14,228 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-01-10 01:14:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:14,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:14,327 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-01-10 01:14:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657091339] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:14,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:14:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9151418] [2025-01-10 01:14:14,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:14,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:14:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:14,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:14:14,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:14:14,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-01-10 01:14:14,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 527 flow. Second operand has 13 states, 13 states have (on average 20.46153846153846) internal successors, (266), 13 states have internal predecessors, (266), 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-01-10 01:14:14,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:14,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-01-10 01:14:14,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:15,152 INFO L124 PetriNetUnfolderBase]: 3788/6119 cut-off events. [2025-01-10 01:14:15,152 INFO L125 PetriNetUnfolderBase]: For 5647/6165 co-relation queries the response was YES. [2025-01-10 01:14:15,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15997 conditions, 6119 events. 3788/6119 cut-off events. For 5647/6165 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 37235 event pairs, 1539 based on Foata normal form. 200/5345 useless extension candidates. Maximal degree in co-relation 9049. Up to 3582 conditions per place. [2025-01-10 01:14:15,177 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 85 selfloop transitions, 23 changer transitions 0/117 dead transitions. [2025-01-10 01:14:15,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 117 transitions, 855 flow [2025-01-10 01:14:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 228 transitions. [2025-01-10 01:14:15,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4453125 [2025-01-10 01:14:15,178 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 527 flow. Second operand 8 states and 228 transitions. [2025-01-10 01:14:15,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 117 transitions, 855 flow [2025-01-10 01:14:15,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 117 transitions, 834 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:15,186 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 567 flow [2025-01-10 01:14:15,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=567, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-01-10 01:14:15,187 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 28 predicate places. [2025-01-10 01:14:15,188 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 567 flow [2025-01-10 01:14:15,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.46153846153846) internal successors, (266), 13 states have internal predecessors, (266), 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-01-10 01:14:15,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:15,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:15,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:15,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:14:15,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:15,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:15,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1977075246, now seen corresponding path program 1 times [2025-01-10 01:14:15,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:15,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742174902] [2025-01-10 01:14:15,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:15,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:15,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:14:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:14:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742174902] [2025-01-10 01:14:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742174902] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112872162] [2025-01-10 01:14:15,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:15,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:15,568 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-01-10 01:14:15,570 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-01-10 01:14:15,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:14:15,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:14:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:15,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:14:15,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:15,638 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-01-10 01:14:15,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:14:15,677 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-01-10 01:14:15,682 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:15,683 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-01-10 01:14:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:15,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:15,806 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-01-10 01:14:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112872162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:15,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:14:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419425378] [2025-01-10 01:14:15,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:15,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:14:15,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:15,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:14:15,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:14:16,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:14:16,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 567 flow. Second operand has 13 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 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-01-10 01:14:16,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:16,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:14:16,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:16,840 INFO L124 PetriNetUnfolderBase]: 5300/8221 cut-off events. [2025-01-10 01:14:16,840 INFO L125 PetriNetUnfolderBase]: For 16192/17756 co-relation queries the response was YES. [2025-01-10 01:14:16,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23795 conditions, 8221 events. 5300/8221 cut-off events. For 16192/17756 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 49085 event pairs, 1694 based on Foata normal form. 0/6869 useless extension candidates. Maximal degree in co-relation 13684. Up to 3194 conditions per place. [2025-01-10 01:14:16,880 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 101 selfloop transitions, 26 changer transitions 0/137 dead transitions. [2025-01-10 01:14:16,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 137 transitions, 1065 flow [2025-01-10 01:14:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:14:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:14:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2025-01-10 01:14:16,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4600694444444444 [2025-01-10 01:14:16,881 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 567 flow. Second operand 9 states and 265 transitions. [2025-01-10 01:14:16,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 137 transitions, 1065 flow [2025-01-10 01:14:16,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 1010 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:16,891 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 636 flow [2025-01-10 01:14:16,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=636, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2025-01-10 01:14:16,891 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 33 predicate places. [2025-01-10 01:14:16,891 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 636 flow [2025-01-10 01:14:16,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 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-01-10 01:14:16,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:16,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:16,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:17,092 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,SelfDestructingSolverStorable14 [2025-01-10 01:14:17,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:17,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1977075244, now seen corresponding path program 1 times [2025-01-10 01:14:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:17,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652602751] [2025-01-10 01:14:17,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:17,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:17,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:14:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:14:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:17,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652602751] [2025-01-10 01:14:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652602751] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639003490] [2025-01-10 01:14:17,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:17,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:17,225 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-01-10 01:14:17,226 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-01-10 01:14:17,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:14:17,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:14:17,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:17,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:17,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:14:17,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:17,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-01-10 01:14:17,355 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:14:17,355 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-01-10 01:14:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:17,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:14:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639003490] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:17,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:14:17,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2025-01-10 01:14:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162357384] [2025-01-10 01:14:17,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:17,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:17,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:17,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:14:17,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:14:17,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 636 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-01-10 01:14:17,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:17,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:14:17,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:18,055 INFO L124 PetriNetUnfolderBase]: 4947/7920 cut-off events. [2025-01-10 01:14:18,056 INFO L125 PetriNetUnfolderBase]: For 12806/14114 co-relation queries the response was YES. [2025-01-10 01:14:18,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24157 conditions, 7920 events. 4947/7920 cut-off events. For 12806/14114 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 48153 event pairs, 2004 based on Foata normal form. 0/7292 useless extension candidates. Maximal degree in co-relation 13885. Up to 3874 conditions per place. [2025-01-10 01:14:18,101 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 96 selfloop transitions, 20 changer transitions 0/126 dead transitions. [2025-01-10 01:14:18,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 126 transitions, 1045 flow [2025-01-10 01:14:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2025-01-10 01:14:18,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-01-10 01:14:18,102 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 636 flow. Second operand 7 states and 228 transitions. [2025-01-10 01:14:18,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 126 transitions, 1045 flow [2025-01-10 01:14:18,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 126 transitions, 1014 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:18,114 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 685 flow [2025-01-10 01:14:18,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=685, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2025-01-10 01:14:18,114 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2025-01-10 01:14:18,114 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 685 flow [2025-01-10 01:14:18,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-01-10 01:14:18,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:18,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:18,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:14:18,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:18,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:18,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1977075248, now seen corresponding path program 1 times [2025-01-10 01:14:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:18,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110674964] [2025-01-10 01:14:18,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:18,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:14:18,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:14:18,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:18,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110674964] [2025-01-10 01:14:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110674964] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406867649] [2025-01-10 01:14:18,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:18,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:18,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:18,514 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-01-10 01:14:18,515 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-01-10 01:14:18,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:14:18,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:14:18,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:18,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:18,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:14:18,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:18,585 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-01-10 01:14:18,589 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-01-10 01:14:18,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:18,623 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-01-10 01:14:18,632 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-01-10 01:14:18,712 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-01-10 01:14:18,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-01-10 01:14:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:19,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406867649] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:19,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:14:19,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2025-01-10 01:14:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222288213] [2025-01-10 01:14:19,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:19,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:19,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:19,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:23,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:27,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:31,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:31,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-01-10 01:14:31,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 685 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-10 01:14:31,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:31,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-01-10 01:14:31,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:39,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:43,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:47,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:51,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:55,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:56,380 INFO L124 PetriNetUnfolderBase]: 6579/10014 cut-off events. [2025-01-10 01:14:56,381 INFO L125 PetriNetUnfolderBase]: For 19845/20441 co-relation queries the response was YES. [2025-01-10 01:14:56,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34083 conditions, 10014 events. 6579/10014 cut-off events. For 19845/20441 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 57802 event pairs, 2208 based on Foata normal form. 270/9720 useless extension candidates. Maximal degree in co-relation 18427. Up to 4563 conditions per place. [2025-01-10 01:14:56,437 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 90 selfloop transitions, 25 changer transitions 0/123 dead transitions. [2025-01-10 01:14:56,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 123 transitions, 1054 flow [2025-01-10 01:14:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2025-01-10 01:14:56,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46651785714285715 [2025-01-10 01:14:56,439 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 685 flow. Second operand 7 states and 209 transitions. [2025-01-10 01:14:56,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 123 transitions, 1054 flow [2025-01-10 01:14:56,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 123 transitions, 1041 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:56,462 INFO L231 Difference]: Finished difference. Result has 103 places, 90 transitions, 733 flow [2025-01-10 01:14:56,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=103, PETRI_TRANSITIONS=90} [2025-01-10 01:14:56,462 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 40 predicate places. [2025-01-10 01:14:56,462 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 90 transitions, 733 flow [2025-01-10 01:14:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-10 01:14:56,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:56,463 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:56,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:56,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:14:56,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:56,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 414691883, now seen corresponding path program 1 times [2025-01-10 01:14:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362615778] [2025-01-10 01:14:56,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:56,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:14:56,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:14:56,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:56,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:56,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362615778] [2025-01-10 01:14:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362615778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667291484] [2025-01-10 01:14:56,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:56,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:56,749 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-01-10 01:14:56,751 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-01-10 01:14:56,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:14:56,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:14:56,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:56,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:14:56,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:56,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667291484] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:56,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:14:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260333154] [2025-01-10 01:14:56,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:56,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:14:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:56,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:14:56,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:14:56,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:14:56,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 90 transitions, 733 flow. Second operand has 14 states, 14 states have (on average 23.357142857142858) internal successors, (327), 14 states have internal predecessors, (327), 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-01-10 01:14:56,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:56,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:14:56,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:57,648 INFO L124 PetriNetUnfolderBase]: 5122/7854 cut-off events. [2025-01-10 01:14:57,648 INFO L125 PetriNetUnfolderBase]: For 28552/28910 co-relation queries the response was YES. [2025-01-10 01:14:57,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29029 conditions, 7854 events. 5122/7854 cut-off events. For 28552/28910 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 44523 event pairs, 2923 based on Foata normal form. 128/7508 useless extension candidates. Maximal degree in co-relation 16394. Up to 3613 conditions per place. [2025-01-10 01:14:57,694 INFO L140 encePairwiseOnDemand]: 50/64 looper letters, 125 selfloop transitions, 36 changer transitions 0/170 dead transitions. [2025-01-10 01:14:57,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 170 transitions, 1564 flow [2025-01-10 01:14:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:14:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:14:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 336 transitions. [2025-01-10 01:14:57,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-01-10 01:14:57,696 INFO L175 Difference]: Start difference. First operand has 103 places, 90 transitions, 733 flow. Second operand 10 states and 336 transitions. [2025-01-10 01:14:57,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 170 transitions, 1564 flow [2025-01-10 01:14:57,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 170 transitions, 1472 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:14:57,714 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 819 flow [2025-01-10 01:14:57,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=819, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2025-01-10 01:14:57,714 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 46 predicate places. [2025-01-10 01:14:57,714 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 819 flow [2025-01-10 01:14:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 23.357142857142858) internal successors, (327), 14 states have internal predecessors, (327), 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-01-10 01:14:57,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:57,715 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:57,721 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-01-10 01:14:57,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:14:57,915 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-10 01:14:57,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2133523681, now seen corresponding path program 1 times [2025-01-10 01:14:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774282852] [2025-01-10 01:14:57,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:57,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:14:57,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:14:57,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:57,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:57,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:57,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774282852] [2025-01-10 01:14:57,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774282852] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:57,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510499022] [2025-01-10 01:14:57,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:57,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:57,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:57,994 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-01-10 01:14:57,996 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-01-10 01:14:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:14:58,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:14:58,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:58,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:58,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:14:58,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:58,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510499022] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:58,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:14:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514685559] [2025-01-10 01:14:58,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:58,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:14:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:58,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:14:58,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:14:58,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:14:58,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 819 flow. Second operand has 14 states, 14 states have (on average 23.571428571428573) internal successors, (330), 14 states have internal predecessors, (330), 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-01-10 01:14:58,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:58,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:14:58,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand