./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.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 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:40:25,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:40:25,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:40:25,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:40:25,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:40:25,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:40:25,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:40:25,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:40:25,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:40:25,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:40:25,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:40:25,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:40:25,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:40:25,436 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:40:25,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:40:25,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:25,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:40:25,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:40:25,438 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 -> 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b [2025-02-08 08:40:25,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:40:25,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:40:25,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:40:25,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:40:25,685 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:40:25,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-02-08 08:40:26,815 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5c251964/924e8512515143a88339969944473c73/FLAGad2abeb8f [2025-02-08 08:40:27,046 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:40:27,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-02-08 08:40:27,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5c251964/924e8512515143a88339969944473c73/FLAGad2abeb8f [2025-02-08 08:40:27,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5c251964/924e8512515143a88339969944473c73 [2025-02-08 08:40:27,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:40:27,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:40:27,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:27,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:40:27,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:40:27,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68001dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27, skipping insertion in model container [2025-02-08 08:40:27,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:40:27,243 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:40:27,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:27,259 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:40:27,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:27,306 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:40:27,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27 WrapperNode [2025-02-08 08:40:27,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:27,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:27,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:40:27,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:40:27,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,349 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 280 [2025-02-08 08:40:27,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:27,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:40:27,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:40:27,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:40:27,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,386 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 08:40:27,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:40:27,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:40:27,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:40:27,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:40:27,416 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (1/1) ... [2025-02-08 08:40:27,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:27,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:27,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:40:27,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:40:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:40:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:40:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:40:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:40:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:40:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:40:27,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:40:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:40:27,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:40:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:40:27,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:40:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 08:40:27,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 08:40:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:40:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:40:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:40:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:40:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:40:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:40:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:40:27,476 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:40:27,578 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:40:27,580 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:40:27,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc #t~post9#1; [2025-02-08 08:40:27,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-1: ~q1_front~0 := 1 + #t~post9#1; [2025-02-08 08:40:27,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-2: #t~post9#1 := ~q1_front~0; [2025-02-08 08:40:27,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: [2025-02-08 08:40:27,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: ~cond~2#1 := (if 0 == (if ~i~0 < ~N~0 || ~q1_front~0 < ~q1_back~0 then 1 else 0) then 0 else 1); [2025-02-08 08:40:27,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc #t~ret8#1; [2025-02-08 08:40:27,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-1: havoc #t~mem7#1; [2025-02-08 08:40:27,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-2: ~total~0 := #t~ret8#1; [2025-02-08 08:40:27,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:40:27,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:27,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:27,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: #t~ret8#1 := plus_#res#1; [2025-02-08 08:40:27,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: [2025-02-08 08:40:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc #t~ret11#1; [2025-02-08 08:40:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc #t~mem10#1; [2025-02-08 08:40:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: ~total~0 := #t~ret11#1; [2025-02-08 08:40:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-6: #t~ret11#1 := plus_#res#1; [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc #t~post12#1; [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: ~q2_front~0 := 1 + #t~post12#1; [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: #t~post12#1 := ~q2_front~0; [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: [2025-02-08 08:40:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: ~cond~3#1 := (if 0 == (if ~j~0 < ~N~0 || ~q2_front~0 < ~q2_back~0 then 1 else 0) then 0 else 1); [2025-02-08 08:40:27,925 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:40:27,926 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:40:28,198 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L171 is not an error location. [2025-02-08 08:40:28,198 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L171 is not an error location. [2025-02-08 08:40:28,199 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:40:28,199 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:40:28,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:28 BoogieIcfgContainer [2025-02-08 08:40:28,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:40:28,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:40:28,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:40:28,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:40:28,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:40:27" (1/3) ... [2025-02-08 08:40:28,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34705e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:28, skipping insertion in model container [2025-02-08 08:40:28,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:27" (2/3) ... [2025-02-08 08:40:28,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34705e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:28, skipping insertion in model container [2025-02-08 08:40:28,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:28" (3/3) ... [2025-02-08 08:40:28,206 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-02-08 08:40:28,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:40:28,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-02-08 08:40:28,222 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:40:28,279 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:40:28,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 64 transitions, 156 flow [2025-02-08 08:40:28,341 INFO L124 PetriNetUnfolderBase]: 4/60 cut-off events. [2025-02-08 08:40:28,343 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:40:28,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 4/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2025-02-08 08:40:28,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 64 transitions, 156 flow [2025-02-08 08:40:28,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 59 transitions, 142 flow [2025-02-08 08:40:28,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:40:28,368 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;@d7e10e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:40:28,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 08:40:28,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:40:28,372 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:40:28,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:40:28,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:28,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:28,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash 744381, now seen corresponding path program 1 times [2025-02-08 08:40:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:28,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640904176] [2025-02-08 08:40:28,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:28,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:28,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:28,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:28,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640904176] [2025-02-08 08:40:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640904176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:40:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310050639] [2025-02-08 08:40:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:28,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:28,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:28,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:28,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:28,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:28,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:28,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:28,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:30,130 INFO L124 PetriNetUnfolderBase]: 13788/18812 cut-off events. [2025-02-08 08:40:30,131 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-02-08 08:40:30,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38132 conditions, 18812 events. 13788/18812 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116077 event pairs, 12544 based on Foata normal form. 1/13166 useless extension candidates. Maximal degree in co-relation 35744. Up to 18312 conditions per place. [2025-02-08 08:40:30,267 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-02-08 08:40:30,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 222 flow [2025-02-08 08:40:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-08 08:40:30,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2025-02-08 08:40:30,280 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 142 flow. Second operand 3 states and 95 transitions. [2025-02-08 08:40:30,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 222 flow [2025-02-08 08:40:30,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 206 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 08:40:30,313 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 122 flow [2025-02-08 08:40:30,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2025-02-08 08:40:30,319 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-02-08 08:40:30,319 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 122 flow [2025-02-08 08:40:30,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:30,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:30,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:30,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:40:30,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:30,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash 744382, now seen corresponding path program 1 times [2025-02-08 08:40:30,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:30,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46901606] [2025-02-08 08:40:30,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:30,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:30,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:30,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:30,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46901606] [2025-02-08 08:40:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46901606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190920848] [2025-02-08 08:40:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:30,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:30,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:30,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:30,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:30,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:30,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:31,809 INFO L124 PetriNetUnfolderBase]: 13789/18815 cut-off events. [2025-02-08 08:40:31,809 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-08 08:40:31,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37493 conditions, 18815 events. 13789/18815 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116135 event pairs, 12544 based on Foata normal form. 0/13166 useless extension candidates. Maximal degree in co-relation 37464. Up to 18321 conditions per place. [2025-02-08 08:40:31,897 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-02-08 08:40:31,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 226 flow [2025-02-08 08:40:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-08 08:40:31,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4453125 [2025-02-08 08:40:31,901 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 122 flow. Second operand 4 states and 114 transitions. [2025-02-08 08:40:31,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 226 flow [2025-02-08 08:40:31,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:31,903 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 145 flow [2025-02-08 08:40:31,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2025-02-08 08:40:31,904 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-02-08 08:40:31,904 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 145 flow [2025-02-08 08:40:31,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:31,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:31,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:40:31,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:40:31,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:31,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash 23077887, now seen corresponding path program 1 times [2025-02-08 08:40:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:31,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260727543] [2025-02-08 08:40:31,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:31,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:40:31,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:40:31,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:31,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260727543] [2025-02-08 08:40:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260727543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247169990] [2025-02-08 08:40:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:32,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:32,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:32,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:32,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:32,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:32,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:32,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:32,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:33,080 INFO L124 PetriNetUnfolderBase]: 13790/18818 cut-off events. [2025-02-08 08:40:33,080 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-08 08:40:33,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37510 conditions, 18818 events. 13790/18818 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116126 event pairs, 12544 based on Foata normal form. 0/13168 useless extension candidates. Maximal degree in co-relation 37485. Up to 18320 conditions per place. [2025-02-08 08:40:33,173 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 45 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-02-08 08:40:33,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 255 flow [2025-02-08 08:40:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-02-08 08:40:33,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415625 [2025-02-08 08:40:33,175 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 145 flow. Second operand 5 states and 133 transitions. [2025-02-08 08:40:33,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 255 flow [2025-02-08 08:40:33,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:33,176 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 179 flow [2025-02-08 08:40:33,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-02-08 08:40:33,178 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-02-08 08:40:33,178 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 179 flow [2025-02-08 08:40:33,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:33,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:33,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:40:33,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:40:33,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 715374734, now seen corresponding path program 1 times [2025-02-08 08:40:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:33,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084337424] [2025-02-08 08:40:33,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:33,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:33,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:33,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:33,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:33,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084337424] [2025-02-08 08:40:33,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084337424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:33,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634635313] [2025-02-08 08:40:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:33,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:33,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:33,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:33,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:40:33,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:33,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:33,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:33,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:33,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:33,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:33,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-08 08:40:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:33,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634635313] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:33,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:40:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063817125] [2025-02-08 08:40:33,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:33,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:33,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:33,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:33,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:33,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 179 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:33,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:33,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:33,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:35,248 INFO L124 PetriNetUnfolderBase]: 13790/18817 cut-off events. [2025-02-08 08:40:35,249 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 08:40:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37523 conditions, 18817 events. 13790/18817 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116081 event pairs, 12544 based on Foata normal form. 0/13170 useless extension candidates. Maximal degree in co-relation 37495. Up to 18320 conditions per place. [2025-02-08 08:40:35,375 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 44 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-02-08 08:40:35,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 277 flow [2025-02-08 08:40:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-08 08:40:35,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2025-02-08 08:40:35,378 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 179 flow. Second operand 6 states and 145 transitions. [2025-02-08 08:40:35,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 277 flow [2025-02-08 08:40:35,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 60 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:35,381 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 188 flow [2025-02-08 08:40:35,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-02-08 08:40:35,381 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:40:35,382 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 188 flow [2025-02-08 08:40:35,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:35,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:35,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:40:35,390 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:40:35,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:35,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:35,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 703036424, now seen corresponding path program 1 times [2025-02-08 08:40:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789037556] [2025-02-08 08:40:35,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:35,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:35,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:35,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:35,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789037556] [2025-02-08 08:40:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789037556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001142986] [2025-02-08 08:40:35,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:35,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:35,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:35,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:35,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:40:35,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:35,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:35,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:35,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:40:35,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:35,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-08 08:40:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:36,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001142986] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:36,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:40:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710327427] [2025-02-08 08:40:36,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:40:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:36,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:40:36,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:40:36,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:36,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 188 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:36,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:36,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:37,152 INFO L124 PetriNetUnfolderBase]: 13792/18822 cut-off events. [2025-02-08 08:40:37,153 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-08 08:40:37,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37549 conditions, 18822 events. 13792/18822 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116157 event pairs, 12544 based on Foata normal form. 0/13175 useless extension candidates. Maximal degree in co-relation 37503. Up to 18313 conditions per place. [2025-02-08 08:40:37,281 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 38 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2025-02-08 08:40:37,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 65 transitions, 329 flow [2025-02-08 08:40:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:40:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:40:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2025-02-08 08:40:37,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2025-02-08 08:40:37,283 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 188 flow. Second operand 9 states and 202 transitions. [2025-02-08 08:40:37,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 65 transitions, 329 flow [2025-02-08 08:40:37,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 282 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-08 08:40:37,284 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 206 flow [2025-02-08 08:40:37,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-02-08 08:40:37,285 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-08 08:40:37,285 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 206 flow [2025-02-08 08:40:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:37,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:37,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:37,297 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:40:37,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:37,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:37,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1410479986, now seen corresponding path program 1 times [2025-02-08 08:40:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:37,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373941365] [2025-02-08 08:40:37,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:37,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:37,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:37,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373941365] [2025-02-08 08:40:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373941365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:37,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145653931] [2025-02-08 08:40:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:37,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:37,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:37,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:40:37,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:37,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:37,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:40:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:38,610 INFO L124 PetriNetUnfolderBase]: 16526/22754 cut-off events. [2025-02-08 08:40:38,610 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-08 08:40:38,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45403 conditions, 22754 events. 16526/22754 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 143505 event pairs, 15126 based on Foata normal form. 630/17129 useless extension candidates. Maximal degree in co-relation 37488. Up to 18327 conditions per place. [2025-02-08 08:40:38,692 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 89 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-02-08 08:40:38,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 516 flow [2025-02-08 08:40:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2025-02-08 08:40:38,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55625 [2025-02-08 08:40:38,694 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 206 flow. Second operand 5 states and 178 transitions. [2025-02-08 08:40:38,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 516 flow [2025-02-08 08:40:38,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 463 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:38,695 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 212 flow [2025-02-08 08:40:38,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2025-02-08 08:40:38,696 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:40:38,696 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 212 flow [2025-02-08 08:40:38,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:38,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:38,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:38,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:40:38,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:38,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash 268981410, now seen corresponding path program 1 times [2025-02-08 08:40:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:38,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-02-08 08:40:38,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:38,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:38,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:38,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:38,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:38,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:38,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:38,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-02-08 08:40:38,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239626672] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:38,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976165322] [2025-02-08 08:40:38,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:38,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:38,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:38,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:38,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:40:38,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:38,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:40:38,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:38,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:40:39,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:40:39,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 08:40:39,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:40:39,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:40:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:39,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976165322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:39,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-02-08 08:40:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672826954] [2025-02-08 08:40:39,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:39,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:39,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:39,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:40:39,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:39,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 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:40:39,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:39,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:39,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:39,868 INFO L124 PetriNetUnfolderBase]: 12600/17396 cut-off events. [2025-02-08 08:40:39,868 INFO L125 PetriNetUnfolderBase]: For 1260/1260 co-relation queries the response was YES. [2025-02-08 08:40:39,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37054 conditions, 17396 events. 12600/17396 cut-off events. For 1260/1260 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 106280 event pairs, 11474 based on Foata normal form. 0/13426 useless extension candidates. Maximal degree in co-relation 29179. Up to 16979 conditions per place. [2025-02-08 08:40:39,926 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 52 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-02-08 08:40:39,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 316 flow [2025-02-08 08:40:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-08 08:40:39,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-02-08 08:40:39,927 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 212 flow. Second operand 4 states and 108 transitions. [2025-02-08 08:40:39,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 316 flow [2025-02-08 08:40:39,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:39,930 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 207 flow [2025-02-08 08:40:39,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-02-08 08:40:39,930 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-08 08:40:39,930 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 207 flow [2025-02-08 08:40:39,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 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:40:39,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:39,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:39,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:40:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:40,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:40,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash 986819598, now seen corresponding path program 1 times [2025-02-08 08:40:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113723252] [2025-02-08 08:40:40,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:40,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:40,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:40,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:40,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113723252] [2025-02-08 08:40:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113723252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:40,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202274279] [2025-02-08 08:40:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:40,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:40,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:40,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:40,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:40,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:40,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:40,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:40,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:40,712 INFO L124 PetriNetUnfolderBase]: 9174/12764 cut-off events. [2025-02-08 08:40:40,712 INFO L125 PetriNetUnfolderBase]: For 931/931 co-relation queries the response was YES. [2025-02-08 08:40:40,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27210 conditions, 12764 events. 9174/12764 cut-off events. For 931/931 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 75434 event pairs, 8266 based on Foata normal form. 0/10544 useless extension candidates. Maximal degree in co-relation 21395. Up to 12400 conditions per place. [2025-02-08 08:40:40,764 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 49 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2025-02-08 08:40:40,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 311 flow [2025-02-08 08:40:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-08 08:40:40,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2025-02-08 08:40:40,765 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 207 flow. Second operand 4 states and 106 transitions. [2025-02-08 08:40:40,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 311 flow [2025-02-08 08:40:40,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:40,767 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 208 flow [2025-02-08 08:40:40,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2025-02-08 08:40:40,768 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-02-08 08:40:40,768 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 208 flow [2025-02-08 08:40:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:40,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:40,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:40,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:40:40,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:40,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:40,769 INFO L85 PathProgramCache]: Analyzing trace with hash 986819599, now seen corresponding path program 1 times [2025-02-08 08:40:40,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:40,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435955563] [2025-02-08 08:40:40,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:40,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:40,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:40,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:40,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:40,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435955563] [2025-02-08 08:40:40,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435955563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:40,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:40,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246366207] [2025-02-08 08:40:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:40,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:40,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:40,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:40,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:40,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:40:40,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:40,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:40,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:40:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:41,520 INFO L124 PetriNetUnfolderBase]: 11787/16699 cut-off events. [2025-02-08 08:40:41,520 INFO L125 PetriNetUnfolderBase]: For 1202/1202 co-relation queries the response was YES. [2025-02-08 08:40:41,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35603 conditions, 16699 events. 11787/16699 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 104520 event pairs, 10753 based on Foata normal form. 500/14978 useless extension candidates. Maximal degree in co-relation 28016. Up to 12416 conditions per place. [2025-02-08 08:40:41,600 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 74 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2025-02-08 08:40:41,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 440 flow [2025-02-08 08:40:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-02-08 08:40:41,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2025-02-08 08:40:41,601 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 208 flow. Second operand 4 states and 146 transitions. [2025-02-08 08:40:41,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 440 flow [2025-02-08 08:40:41,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:41,604 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 226 flow [2025-02-08 08:40:41,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-02-08 08:40:41,604 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:40:41,604 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 226 flow [2025-02-08 08:40:41,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:41,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:41,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:41,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:40:41,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:41,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash 268981409, now seen corresponding path program 1 times [2025-02-08 08:40:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:41,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695757655] [2025-02-08 08:40:41,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:41,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:41,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:41,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:41,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:41,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695757655] [2025-02-08 08:40:41,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695757655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:41,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:41,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285999444] [2025-02-08 08:40:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:41,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:41,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:41,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:41,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:40:41,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:41,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:41,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:40:41,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:42,254 INFO L124 PetriNetUnfolderBase]: 8716/12455 cut-off events. [2025-02-08 08:40:42,254 INFO L125 PetriNetUnfolderBase]: For 1841/1841 co-relation queries the response was YES. [2025-02-08 08:40:42,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27444 conditions, 12455 events. 8716/12455 cut-off events. For 1841/1841 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 75889 event pairs, 7905 based on Foata normal form. 0/11382 useless extension candidates. Maximal degree in co-relation 19334. Up to 12029 conditions per place. [2025-02-08 08:40:42,303 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 44 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2025-02-08 08:40:42,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 61 transitions, 322 flow [2025-02-08 08:40:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-02-08 08:40:42,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-02-08 08:40:42,304 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 226 flow. Second operand 5 states and 120 transitions. [2025-02-08 08:40:42,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 61 transitions, 322 flow [2025-02-08 08:40:42,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:42,307 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 229 flow [2025-02-08 08:40:42,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-02-08 08:40:42,308 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2025-02-08 08:40:42,308 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 229 flow [2025-02-08 08:40:42,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:42,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:42,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:40:42,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:42,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1567680168, now seen corresponding path program 1 times [2025-02-08 08:40:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432357442] [2025-02-08 08:40:42,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:42,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:42,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:42,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:42,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:42,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:42,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432357442] [2025-02-08 08:40:42,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432357442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604876236] [2025-02-08 08:40:42,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:42,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:42,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:42,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:42,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:40:42,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:42,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:42,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:42,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:42,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:40:42,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:42,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:42,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604876236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:42,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:42,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-08 08:40:42,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756972336] [2025-02-08 08:40:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:42,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:42,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:42,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:40:42,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:40:42,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:42,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:42,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:40:42,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:43,294 INFO L124 PetriNetUnfolderBase]: 6585/9541 cut-off events. [2025-02-08 08:40:43,295 INFO L125 PetriNetUnfolderBase]: For 1488/1488 co-relation queries the response was YES. [2025-02-08 08:40:43,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20498 conditions, 9541 events. 6585/9541 cut-off events. For 1488/1488 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 57200 event pairs, 5929 based on Foata normal form. 0/9295 useless extension candidates. Maximal degree in co-relation 14443. Up to 9165 conditions per place. [2025-02-08 08:40:43,340 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 41 selfloop transitions, 7 changer transitions 2/59 dead transitions. [2025-02-08 08:40:43,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 59 transitions, 321 flow [2025-02-08 08:40:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-08 08:40:43,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2025-02-08 08:40:43,342 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 229 flow. Second operand 4 states and 110 transitions. [2025-02-08 08:40:43,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 59 transitions, 321 flow [2025-02-08 08:40:43,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 59 transitions, 309 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:40:43,345 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 215 flow [2025-02-08 08:40:43,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2025-02-08 08:40:43,346 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-08 08:40:43,346 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 215 flow [2025-02-08 08:40:43,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:43,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:43,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:43,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:40:43,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:40:43,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash -313182936, now seen corresponding path program 1 times [2025-02-08 08:40:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651816099] [2025-02-08 08:40:43,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:43,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:40:43,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:40:43,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:43,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:43,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651816099] [2025-02-08 08:40:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651816099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:43,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:43,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038032062] [2025-02-08 08:40:43,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:43,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:43,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:43,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:43,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:40:43,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:43,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:43,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:40:43,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:43,953 INFO L124 PetriNetUnfolderBase]: 4540/6748 cut-off events. [2025-02-08 08:40:43,953 INFO L125 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2025-02-08 08:40:43,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13985 conditions, 6748 events. 4540/6748 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 39871 event pairs, 4096 based on Foata normal form. 4/6676 useless extension candidates. Maximal degree in co-relation 8884. Up to 6454 conditions per place. [2025-02-08 08:40:43,967 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2025-02-08 08:40:43,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 305 flow [2025-02-08 08:40:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-08 08:40:43,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-08 08:40:43,968 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 215 flow. Second operand 3 states and 88 transitions. [2025-02-08 08:40:43,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 305 flow [2025-02-08 08:40:43,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 55 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:43,970 INFO L231 Difference]: Finished difference. Result has 64 places, 0 transitions, 0 flow [2025-02-08 08:40:43,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=64, PETRI_TRANSITIONS=0} [2025-02-08 08:40:43,970 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-02-08 08:40:43,970 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 0 transitions, 0 flow [2025-02-08 08:40:43,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:43,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 26 remaining) [2025-02-08 08:40:43,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (15 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-02-08 08:40:43,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-02-08 08:40:43,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:40:43,974 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:43,977 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:40:43,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:40:43,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:40:43 BasicIcfg [2025-02-08 08:40:43,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:40:43,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:40:43,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:40:43,981 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:40:43,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:28" (3/4) ... [2025-02-08 08:40:43,982 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:40:43,984 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:40:43,984 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:40:43,984 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:40:43,985 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 08:40:43,988 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 114 nodes and edges [2025-02-08 08:40:43,988 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2025-02-08 08:40:43,989 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 08:40:43,989 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:40:44,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:40:44,048 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:40:44,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:40:44,048 INFO L158 Benchmark]: Toolchain (without parser) took 16972.38ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 123.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-08 08:40:44,048 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:44,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.70ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 110.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:44,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.25ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:44,049 INFO L158 Benchmark]: Boogie Preprocessor took 62.83ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:44,049 INFO L158 Benchmark]: IcfgBuilder took 784.30ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 113.1MB in the end (delta: -7.1MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:44,049 INFO L158 Benchmark]: TraceAbstraction took 15779.15ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 112.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-08 08:40:44,049 INFO L158 Benchmark]: Witness Printer took 67.07ms. Allocated memory is still 3.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:44,050 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.70ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 110.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.25ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.83ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 784.30ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 113.1MB in the end (delta: -7.1MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15779.15ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 112.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 67.07ms. Allocated memory is still 3.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 125]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 26 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: 15.7s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1723 IncrementalHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 16 mSDtfsCounter, 1723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=10, InterpolantAutomatonStates: 56, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 136 ConstructedInterpolants, 3 QuantifiedInterpolants, 1651 SizeOfPredicates, 11 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 23/37 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 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:40:44,064 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