./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:38:31,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:38:31,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:38:31,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:38:31,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:38:31,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:38:31,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:38:31,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:38:31,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:38:31,398 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:38:31,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:38:31,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:38:31,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:38:31,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:38:31,400 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:38:31,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:31,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:38:31,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:38:31,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:38:31,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:38:31,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:38:31,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:38:31,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:38:31,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:38:31,401 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-02-08 08:38:31,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:38:31,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:38:31,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:38:31,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:38:31,658 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:38:31,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-08 08:38:32,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f51c1624/2be70af008444debb52a4ebdb667e0db/FLAG75801b398 [2025-02-08 08:38:32,975 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:38:32,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-08 08:38:33,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f51c1624/2be70af008444debb52a4ebdb667e0db/FLAG75801b398 [2025-02-08 08:38:33,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f51c1624/2be70af008444debb52a4ebdb667e0db [2025-02-08 08:38:33,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:38:33,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:38:33,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:33,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:38:33,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:38:33,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c38d0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33, skipping insertion in model container [2025-02-08 08:38:33,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:38:33,183 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:38:33,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:33,198 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:38:33,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:33,232 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:38:33,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33 WrapperNode [2025-02-08 08:38:33,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:33,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:33,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:38:33,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:38:33,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,261 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 127 [2025-02-08 08:38:33,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:33,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:38:33,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:38:33,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:38:33,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,294 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 08:38:33,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:38:33,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:38:33,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:38:33,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:38:33,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (1/1) ... [2025-02-08 08:38:33,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:33,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:33,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:38:33,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:38:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:38:33,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:38:33,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:38:33,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:38:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:38:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:38:33,361 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:38:33,432 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:38:33,433 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:38:33,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: [2025-02-08 08:38:33,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-1: ~counter~0 := ~tmp~0#1; [2025-02-08 08:38:33,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~post3#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: #t~post3#1 := ~i~0#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: havoc ~tmp~0#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~ret2#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-1: havoc #t~mem1#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: ~tmp~0#1 := #t~ret2#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:33,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-6: #t~ret2#1 := plus_#res#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58: havoc #t~ret5#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-1: havoc #t~mem4#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: ~tmp~1#1 := #t~ret5#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-5: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-6: #t~ret5#1 := minus_#res#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: ~counter~0 := ~tmp~1#1; [2025-02-08 08:38:33,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: havoc #t~post6#1; [2025-02-08 08:38:33,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-2: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 08:38:33,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-3: #t~post6#1 := ~i~1#1; [2025-02-08 08:38:33,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-4: havoc ~tmp~1#1; [2025-02-08 08:38:33,652 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:38:33,653 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:38:33,816 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:38:33,816 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:38:33,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:33 BoogieIcfgContainer [2025-02-08 08:38:33,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:38:33,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:38:33,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:38:33,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:38:33,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:38:33" (1/3) ... [2025-02-08 08:38:33,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72749f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:33, skipping insertion in model container [2025-02-08 08:38:33,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:33" (2/3) ... [2025-02-08 08:38:33,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72749f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:33, skipping insertion in model container [2025-02-08 08:38:33,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:33" (3/3) ... [2025-02-08 08:38:33,824 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-02-08 08:38:33,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:38:33,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-02-08 08:38:33,838 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:38:33,903 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:38:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 76 flow [2025-02-08 08:38:33,953 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2025-02-08 08:38:33,955 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:38:33,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 1/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-02-08 08:38:33,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 76 flow [2025-02-08 08:38:33,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 68 flow [2025-02-08 08:38:33,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:38:33,985 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;@657669d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:38:33,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-08 08:38:33,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:38:33,990 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:38:33,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:38:33,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:33,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:33,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:33,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 359588, now seen corresponding path program 1 times [2025-02-08 08:38:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173201499] [2025-02-08 08:38:34,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:34,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:34,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:34,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:34,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:34,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173201499] [2025-02-08 08:38:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173201499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:34,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:38:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591922389] [2025-02-08 08:38:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:34,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:34,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:34,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:34,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:34,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-02-08 08:38:34,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:34,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-02-08 08:38:34,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:34,335 INFO L124 PetriNetUnfolderBase]: 43/109 cut-off events. [2025-02-08 08:38:34,335 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:38:34,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 109 events. 43/109 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 393 event pairs, 42 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 179. Up to 90 conditions per place. [2025-02-08 08:38:34,337 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 15 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2025-02-08 08:38:34,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 96 flow [2025-02-08 08:38:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-02-08 08:38:34,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2025-02-08 08:38:34,347 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 68 flow. Second operand 3 states and 52 transitions. [2025-02-08 08:38:34,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 96 flow [2025-02-08 08:38:34,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:38:34,351 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2025-02-08 08:38:34,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-02-08 08:38:34,355 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-02-08 08:38:34,356 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2025-02-08 08:38:34,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:34,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:38:34,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:34,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash 359589, now seen corresponding path program 1 times [2025-02-08 08:38:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670930672] [2025-02-08 08:38:34,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:34,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:34,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:34,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:34,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670930672] [2025-02-08 08:38:34,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670930672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:34,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:34,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:34,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788193810] [2025-02-08 08:38:34,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:34,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:34,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:34,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:34,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:34,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-02-08 08:38:34,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:34,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-02-08 08:38:34,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:34,649 INFO L124 PetriNetUnfolderBase]: 43/108 cut-off events. [2025-02-08 08:38:34,650 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:38:34,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 108 events. 43/108 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 394 event pairs, 42 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 197. Up to 90 conditions per place. [2025-02-08 08:38:34,651 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 13 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2025-02-08 08:38:34,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 90 flow [2025-02-08 08:38:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-02-08 08:38:34,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:38:34,652 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 4 states and 62 transitions. [2025-02-08 08:38:34,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 90 flow [2025-02-08 08:38:34,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 24 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:34,653 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 60 flow [2025-02-08 08:38:34,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2025-02-08 08:38:34,655 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-02-08 08:38:34,655 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 60 flow [2025-02-08 08:38:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:34,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:38:34,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:38:34,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:34,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2124710393, now seen corresponding path program 1 times [2025-02-08 08:38:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926047474] [2025-02-08 08:38:34,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:34,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:34,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:38:34,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:38:34,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:34,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926047474] [2025-02-08 08:38:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926047474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:34,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204947320] [2025-02-08 08:38:34,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:34,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:34,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:34,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-02-08 08:38:34,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:34,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-02-08 08:38:34,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:34,813 INFO L124 PetriNetUnfolderBase]: 43/103 cut-off events. [2025-02-08 08:38:34,813 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:38:34,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 103 events. 43/103 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 350 event pairs, 42 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 192. Up to 89 conditions per place. [2025-02-08 08:38:34,815 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 15 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-02-08 08:38:34,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 90 flow [2025-02-08 08:38:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-02-08 08:38:34,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2025-02-08 08:38:34,818 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 60 flow. Second operand 4 states and 55 transitions. [2025-02-08 08:38:34,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 90 flow [2025-02-08 08:38:34,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:34,818 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 52 flow [2025-02-08 08:38:34,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2025-02-08 08:38:34,821 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -7 predicate places. [2025-02-08 08:38:34,821 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 52 flow [2025-02-08 08:38:34,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:34,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:38:34,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:38:34,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:34,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2124710394, now seen corresponding path program 1 times [2025-02-08 08:38:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803456450] [2025-02-08 08:38:34,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:34,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:38:34,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:38:34,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:34,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803456450] [2025-02-08 08:38:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803456450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469489322] [2025-02-08 08:38:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:34,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:34,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:34,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-02-08 08:38:34,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:34,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-02-08 08:38:34,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:35,043 INFO L124 PetriNetUnfolderBase]: 85/201 cut-off events. [2025-02-08 08:38:35,044 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:38:35,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 201 events. 85/201 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 828 event pairs, 69 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 239. Up to 115 conditions per place. [2025-02-08 08:38:35,046 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 32 selfloop transitions, 5 changer transitions 2/43 dead transitions. [2025-02-08 08:38:35,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 43 transitions, 179 flow [2025-02-08 08:38:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-02-08 08:38:35,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-02-08 08:38:35,049 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 52 flow. Second operand 5 states and 95 transitions. [2025-02-08 08:38:35,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 43 transitions, 179 flow [2025-02-08 08:38:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:35,051 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 86 flow [2025-02-08 08:38:35,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-02-08 08:38:35,052 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-02-08 08:38:35,053 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 86 flow [2025-02-08 08:38:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:35,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:35,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:35,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:38:35,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash 42062751, now seen corresponding path program 1 times [2025-02-08 08:38:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088658019] [2025-02-08 08:38:35,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:35,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:38:35,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:38:35,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:35,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088658019] [2025-02-08 08:38:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088658019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014921354] [2025-02-08 08:38:35,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:35,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:38:35,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:38:35,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:38:35,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:38:35,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:35,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:38:35,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:35,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:35,389 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 22 treesize of output 18 [2025-02-08 08:38:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014921354] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:35,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:35,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 08:38:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924504371] [2025-02-08 08:38:35,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:35,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:38:35,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:35,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:38:35,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:38:35,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-02-08 08:38:35,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 86 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 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-02-08 08:38:35,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:35,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-02-08 08:38:35,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:35,626 INFO L124 PetriNetUnfolderBase]: 73/183 cut-off events. [2025-02-08 08:38:35,626 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 08:38:35,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 183 events. 73/183 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 762 event pairs, 48 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 235. Up to 68 conditions per place. [2025-02-08 08:38:35,627 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 29 selfloop transitions, 6 changer transitions 3/42 dead transitions. [2025-02-08 08:38:35,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 199 flow [2025-02-08 08:38:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-02-08 08:38:35,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2025-02-08 08:38:35,628 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 86 flow. Second operand 6 states and 105 transitions. [2025-02-08 08:38:35,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 199 flow [2025-02-08 08:38:35,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:35,630 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 92 flow [2025-02-08 08:38:35,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-02-08 08:38:35,630 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-02-08 08:38:35,630 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 92 flow [2025-02-08 08:38:35,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 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-02-08 08:38:35,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:35,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:35,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:38:35,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:35,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:35,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1710811574, now seen corresponding path program 1 times [2025-02-08 08:38:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:35,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280681606] [2025-02-08 08:38:35,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:35,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:38:35,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:38:35,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280681606] [2025-02-08 08:38:35,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280681606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:35,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:35,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469520735] [2025-02-08 08:38:35,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:35,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:35,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:35,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:35,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-02-08 08:38:35,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:35,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:35,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-02-08 08:38:35,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:35,953 INFO L124 PetriNetUnfolderBase]: 65/158 cut-off events. [2025-02-08 08:38:35,953 INFO L125 PetriNetUnfolderBase]: For 103/110 co-relation queries the response was YES. [2025-02-08 08:38:35,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 158 events. 65/158 cut-off events. For 103/110 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 576 event pairs, 56 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 234. Up to 93 conditions per place. [2025-02-08 08:38:35,955 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 30 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-02-08 08:38:35,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 203 flow [2025-02-08 08:38:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-02-08 08:38:35,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5870967741935483 [2025-02-08 08:38:35,956 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 92 flow. Second operand 5 states and 91 transitions. [2025-02-08 08:38:35,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 203 flow [2025-02-08 08:38:35,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 191 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:35,958 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 107 flow [2025-02-08 08:38:35,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2025-02-08 08:38:35,958 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-02-08 08:38:35,958 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 107 flow [2025-02-08 08:38:35,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:35,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:35,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:35,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:38:35,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1741186587, now seen corresponding path program 1 times [2025-02-08 08:38:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696465780] [2025-02-08 08:38:35,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:35,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:35,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:35,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:35,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:36,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:36,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696465780] [2025-02-08 08:38:36,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696465780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:36,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263701933] [2025-02-08 08:38:36,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:36,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:36,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:36,078 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:38:36,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:38:36,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:36,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:36,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:38:36,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:36,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:36,209 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 22 treesize of output 18 [2025-02-08 08:38:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:36,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263701933] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:36,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:36,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-08 08:38:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990302310] [2025-02-08 08:38:36,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:36,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:38:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:36,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:38:36,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:38:36,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-02-08 08:38:36,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 107 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:36,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:36,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-02-08 08:38:36,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:36,367 INFO L124 PetriNetUnfolderBase]: 54/138 cut-off events. [2025-02-08 08:38:36,367 INFO L125 PetriNetUnfolderBase]: For 99/105 co-relation queries the response was YES. [2025-02-08 08:38:36,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 138 events. 54/138 cut-off events. For 99/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 487 event pairs, 42 based on Foata normal form. 9/146 useless extension candidates. Maximal degree in co-relation 214. Up to 53 conditions per place. [2025-02-08 08:38:36,369 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 27 selfloop transitions, 6 changer transitions 2/38 dead transitions. [2025-02-08 08:38:36,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 212 flow [2025-02-08 08:38:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2025-02-08 08:38:36,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-02-08 08:38:36,370 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 107 flow. Second operand 6 states and 102 transitions. [2025-02-08 08:38:36,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 212 flow [2025-02-08 08:38:36,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:36,371 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 110 flow [2025-02-08 08:38:36,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2025-02-08 08:38:36,372 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-02-08 08:38:36,372 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 110 flow [2025-02-08 08:38:36,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:36,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:36,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:36,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:38:36,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:36,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:38:36,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1086608562, now seen corresponding path program 1 times [2025-02-08 08:38:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094872049] [2025-02-08 08:38:36,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:36,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:38:36,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:38:36,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:36,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:36,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094872049] [2025-02-08 08:38:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094872049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:36,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:36,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134167178] [2025-02-08 08:38:36,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:36,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:36,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:36,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:36,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:36,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-02-08 08:38:36,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:36,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:36,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-02-08 08:38:36,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:36,624 INFO L124 PetriNetUnfolderBase]: 45/117 cut-off events. [2025-02-08 08:38:36,624 INFO L125 PetriNetUnfolderBase]: For 106/110 co-relation queries the response was YES. [2025-02-08 08:38:36,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 117 events. 45/117 cut-off events. For 106/110 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 381 event pairs, 44 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 195. Up to 107 conditions per place. [2025-02-08 08:38:36,625 INFO L140 encePairwiseOnDemand]: 29/31 looper letters, 0 selfloop transitions, 0 changer transitions 22/22 dead transitions. [2025-02-08 08:38:36,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 22 transitions, 146 flow [2025-02-08 08:38:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-02-08 08:38:36,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-02-08 08:38:36,625 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 110 flow. Second operand 3 states and 51 transitions. [2025-02-08 08:38:36,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 22 transitions, 146 flow [2025-02-08 08:38:36,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 22 transitions, 134 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 08:38:36,626 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2025-02-08 08:38:36,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2025-02-08 08:38:36,627 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-02-08 08:38:36,627 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2025-02-08 08:38:36,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:36,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-02-08 08:38:36,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-08 08:38:36,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-02-08 08:38:36,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:38:36,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:36,635 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:38:36,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:38:36,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:38:36 BasicIcfg [2025-02-08 08:38:36,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:38:36,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:38:36,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:38:36,642 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:38:36,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:33" (3/4) ... [2025-02-08 08:38:36,644 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:38:36,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:38:36,646 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:38:36,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-02-08 08:38:36,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-02-08 08:38:36,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 08:38:36,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:38:36,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:38:36,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:38:36,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:38:36,715 INFO L158 Benchmark]: Toolchain (without parser) took 3692.38ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 116.7MB in the beginning and 283.2MB in the end (delta: -166.5MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. [2025-02-08 08:38:36,715 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:38:36,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.44ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 104.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:38:36,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.43ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 102.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:38:36,716 INFO L158 Benchmark]: Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:38:36,716 INFO L158 Benchmark]: IcfgBuilder took 504.89ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 62.7MB in the end (delta: 38.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 08:38:36,716 INFO L158 Benchmark]: TraceAbstraction took 2822.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 61.9MB in the beginning and 289.0MB in the end (delta: -227.1MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-02-08 08:38:36,716 INFO L158 Benchmark]: Witness Printer took 72.29ms. Allocated memory is still 427.8MB. Free memory was 289.0MB in the beginning and 283.2MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:38:36,717 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.44ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 104.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.43ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 102.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 504.89ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 62.7MB in the end (delta: 38.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2822.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 61.9MB in the beginning and 289.0MB in the end (delta: -227.1MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 72.29ms. Allocated memory is still 427.8MB. Free memory was 289.0MB in the beginning and 283.2MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 65]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 882 IncrementalHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 8 mSDtfsCounter, 882 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 8 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:38:36,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE