./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.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 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:38:12,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:38:12,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:38:12,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:38:12,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:38:12,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:38:12,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:38:12,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:38:12,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:38:12,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:38:12,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:38:12,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:38:12,228 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:38:12,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:12,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:38:12,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:38:12,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:38:12,230 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 -> 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f [2025-02-08 08:38:12,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:38:12,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:38:12,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:38:12,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:38:12,453 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:38:12,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-02-08 08:38:13,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9226bff0/bdd164a2821d4c30ac92b780a3fc26b9/FLAG05a0d0a7b [2025-02-08 08:38:13,833 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:38:13,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-02-08 08:38:13,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9226bff0/bdd164a2821d4c30ac92b780a3fc26b9/FLAG05a0d0a7b [2025-02-08 08:38:13,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9226bff0/bdd164a2821d4c30ac92b780a3fc26b9 [2025-02-08 08:38:13,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:38:13,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:38:13,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:13,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:38:13,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:38:13,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:13" (1/1) ... [2025-02-08 08:38:13,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:13, skipping insertion in model container [2025-02-08 08:38:13,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:13" (1/1) ... [2025-02-08 08:38:13,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:38:14,018 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:38:14,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:14,036 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:38:14,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:14,087 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:38:14,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14 WrapperNode [2025-02-08 08:38:14,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:14,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:14,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:38:14,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:38:14,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,139 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 295 [2025-02-08 08:38:14,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:14,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:38:14,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:38:14,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:38:14,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,170 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:38:14,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:38:14,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:38:14,192 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:38:14,192 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:38:14,193 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (1/1) ... [2025-02-08 08:38:14,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:14,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:14,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:38:14,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:38:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:38:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:38:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:38:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:38:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 08:38:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:38:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:38:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:38:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:38:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:38:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:38:14,243 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:38:14,340 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:38:14,343 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:38:14,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: ~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:38:14,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc #t~ret10#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: havoc #t~mem9#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-2: ~total~0 := #t~ret10#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-6: #t~ret10#1 := plus_#res#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc #t~post11#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-1: ~q1_front~0 := 1 + #t~post11#1; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-2: #t~post11#1 := ~q1_front~0; [2025-02-08 08:38:14,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: [2025-02-08 08:38:14,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: ~cond~3#1 := (if 0 == (if ~j~0 < ~M~0 || ~q2_front~0 < ~q2_back~0 then 1 else 0) then 0 else 1); [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc #t~ret13#1; [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: havoc #t~mem12#1; [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-2: ~total~0 := #t~ret13#1; [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-6: #t~ret13#1 := plus_#res#1; [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: [2025-02-08 08:38:14,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc #t~post14#1; [2025-02-08 08:38:14,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: ~q2_front~0 := 1 + #t~post14#1; [2025-02-08 08:38:14,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: #t~post14#1 := ~q2_front~0; [2025-02-08 08:38:14,740 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:38:14,741 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:38:15,046 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L173 is not an error location. [2025-02-08 08:38:15,047 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L173 is not an error location. [2025-02-08 08:38:15,048 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:38:15,049 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:38:15,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:15 BoogieIcfgContainer [2025-02-08 08:38:15,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:38:15,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:38:15,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:38:15,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:38:15,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:38:13" (1/3) ... [2025-02-08 08:38:15,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2459166a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:15, skipping insertion in model container [2025-02-08 08:38:15,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:14" (2/3) ... [2025-02-08 08:38:15,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2459166a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:15, skipping insertion in model container [2025-02-08 08:38:15,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:15" (3/3) ... [2025-02-08 08:38:15,057 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-02-08 08:38:15,070 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:38:15,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-02-08 08:38:15,072 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:38:15,143 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:38:15,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 64 transitions, 156 flow [2025-02-08 08:38:15,218 INFO L124 PetriNetUnfolderBase]: 4/60 cut-off events. [2025-02-08 08:38:15,223 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:38:15,228 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 6. Compared 142 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:38:15,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 64 transitions, 156 flow [2025-02-08 08:38:15,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 59 transitions, 142 flow [2025-02-08 08:38:15,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:38:15,254 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;@c6a3634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:38:15,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 08:38:15,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:38:15,260 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:38:15,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:38:15,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:15,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:15,262 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:38:15,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 773715, now seen corresponding path program 1 times [2025-02-08 08:38:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:15,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717213671] [2025-02-08 08:38:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:15,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:15,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:15,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:15,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717213671] [2025-02-08 08:38:15,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717213671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:15,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:38:15,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971289999] [2025-02-08 08:38:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:15,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:15,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:15,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:15,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:15,508 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:38:15,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:15,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:15,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:17,029 INFO L124 PetriNetUnfolderBase]: 13788/18812 cut-off events. [2025-02-08 08:38:17,029 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-02-08 08:38:17,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38132 conditions, 18812 events. 13788/18812 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 114547 event pairs, 12544 based on Foata normal form. 1/12944 useless extension candidates. Maximal degree in co-relation 35744. Up to 18312 conditions per place. [2025-02-08 08:38:17,145 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-02-08 08:38:17,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 222 flow [2025-02-08 08:38:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-08 08:38:17,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2025-02-08 08:38:17,157 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:38:17,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 222 flow [2025-02-08 08:38:17,186 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:38:17,188 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 122 flow [2025-02-08 08:38:17,190 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:38:17,192 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-02-08 08:38:17,192 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 122 flow [2025-02-08 08:38:17,192 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:38:17,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:17,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:17,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:38:17,193 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:38:17,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash 773716, now seen corresponding path program 1 times [2025-02-08 08:38:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035962910] [2025-02-08 08:38:17,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:17,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:17,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:17,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:17,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:17,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:17,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035962910] [2025-02-08 08:38:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035962910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:17,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:17,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692563806] [2025-02-08 08:38:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:17,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:17,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:17,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:17,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:17,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:17,502 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:38:17,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:17,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:17,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:18,678 INFO L124 PetriNetUnfolderBase]: 13789/18815 cut-off events. [2025-02-08 08:38:18,678 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 08:38:18,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37493 conditions, 18815 events. 13789/18815 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 114578 event pairs, 12544 based on Foata normal form. 0/12944 useless extension candidates. Maximal degree in co-relation 37464. Up to 18321 conditions per place. [2025-02-08 08:38:18,862 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-02-08 08:38:18,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 226 flow [2025-02-08 08:38:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-08 08:38:18,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4453125 [2025-02-08 08:38:18,864 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:38:18,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 226 flow [2025-02-08 08:38:18,864 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:38:18,866 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 145 flow [2025-02-08 08:38:18,866 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:38:18,866 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-02-08 08:38:18,866 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 145 flow [2025-02-08 08:38:18,866 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:38:18,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:18,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:38:18,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:38:18,868 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:38:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 23986404, now seen corresponding path program 1 times [2025-02-08 08:38:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-02-08 08:38:18,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:18,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:38:18,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:38:18,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:18,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-02-08 08:38:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672514256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:19,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:19,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074863733] [2025-02-08 08:38:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:19,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:19,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:19,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:19,052 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:38:19,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:19,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:19,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:20,051 INFO L124 PetriNetUnfolderBase]: 13790/18818 cut-off events. [2025-02-08 08:38:20,051 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 08:38:20,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37510 conditions, 18818 events. 13790/18818 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 114677 event pairs, 12544 based on Foata normal form. 0/12946 useless extension candidates. Maximal degree in co-relation 37485. Up to 18320 conditions per place. [2025-02-08 08:38:20,144 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 45 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-02-08 08:38:20,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 255 flow [2025-02-08 08:38:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-02-08 08:38:20,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415625 [2025-02-08 08:38:20,147 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:38:20,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 255 flow [2025-02-08 08:38:20,148 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:38:20,148 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 179 flow [2025-02-08 08:38:20,149 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:38:20,149 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-02-08 08:38:20,149 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 179 flow [2025-02-08 08:38:20,149 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:38:20,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:20,149 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:38:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:38:20,151 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:38:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash 743566173, now seen corresponding path program 1 times [2025-02-08 08:38:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667893656] [2025-02-08 08:38:20,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:20,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:38:20,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:38:20,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:20,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:20,381 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:38:20,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667893656] [2025-02-08 08:38:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667893656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724134418] [2025-02-08 08:38:20,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:20,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:20,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:20,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:38:20,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:38:20,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:38:20,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:38:20,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:20,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:20,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:38:20,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:20,511 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:38:20,695 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:38:20,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:20,817 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:38:20,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724134418] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:20,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:20,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:38:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26193272] [2025-02-08 08:38:20,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:20,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:38:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:20,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:38:20,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:38:20,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:20,877 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:38:20,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:20,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:20,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:22,300 INFO L124 PetriNetUnfolderBase]: 13790/18817 cut-off events. [2025-02-08 08:38:22,303 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-02-08 08:38:22,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37523 conditions, 18817 events. 13790/18817 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 114688 event pairs, 12544 based on Foata normal form. 0/12948 useless extension candidates. Maximal degree in co-relation 37495. Up to 18320 conditions per place. [2025-02-08 08:38:22,387 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 44 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-02-08 08:38:22,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 277 flow [2025-02-08 08:38:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-08 08:38:22,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2025-02-08 08:38:22,391 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:38:22,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 277 flow [2025-02-08 08:38:22,392 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:38:22,392 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 188 flow [2025-02-08 08:38:22,392 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:38:22,393 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:38:22,393 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 188 flow [2025-02-08 08:38:22,393 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:38:22,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:22,393 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:38:22,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:38:22,598 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:38:22,598 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:38:22,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1576121633, now seen corresponding path program 1 times [2025-02-08 08:38:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649276162] [2025-02-08 08:38:22,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:22,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:38:22,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:38:22,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:22,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:22,805 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:38:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649276162] [2025-02-08 08:38:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649276162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807396515] [2025-02-08 08:38:22,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:22,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:22,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:38:22,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:38:22,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:38:22,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:38:22,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:22,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:22,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:38:22,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:22,895 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:38:23,015 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:38:23,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:23,126 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:38:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807396515] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:23,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:38:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355248157] [2025-02-08 08:38:23,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:23,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:38:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:23,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:38:23,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:38:23,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:23,191 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:38:23,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:23,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:23,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:24,308 INFO L124 PetriNetUnfolderBase]: 13792/18822 cut-off events. [2025-02-08 08:38:24,308 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 08:38:24,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37549 conditions, 18822 events. 13792/18822 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 114588 event pairs, 12544 based on Foata normal form. 0/12953 useless extension candidates. Maximal degree in co-relation 37503. Up to 18313 conditions per place. [2025-02-08 08:38:24,386 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 38 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2025-02-08 08:38:24,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 65 transitions, 329 flow [2025-02-08 08:38:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:38:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:38:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2025-02-08 08:38:24,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2025-02-08 08:38:24,388 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:38:24,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 65 transitions, 329 flow [2025-02-08 08:38:24,389 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:38:24,390 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 206 flow [2025-02-08 08:38:24,390 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:38:24,390 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-08 08:38:24,390 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 206 flow [2025-02-08 08:38:24,391 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:38:24,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:24,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:24,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:38:24,595 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:38:24,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:38:24,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1364887591, now seen corresponding path program 1 times [2025-02-08 08:38:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-02-08 08:38:24,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:24,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:38:24,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:38:24,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:24,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:24,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-02-08 08:38:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340271110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871594725] [2025-02-08 08:38:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:24,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:24,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:24,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:24,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:38:24,680 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:38:24,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:24,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:38:24,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:25,672 INFO L124 PetriNetUnfolderBase]: 16526/22754 cut-off events. [2025-02-08 08:38:25,672 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 08:38:25,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45403 conditions, 22754 events. 16526/22754 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 143058 event pairs, 15126 based on Foata normal form. 630/17090 useless extension candidates. Maximal degree in co-relation 37488. Up to 18327 conditions per place. [2025-02-08 08:38:25,773 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 89 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-02-08 08:38:25,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 516 flow [2025-02-08 08:38:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2025-02-08 08:38:25,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55625 [2025-02-08 08:38:25,775 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:38:25,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 516 flow [2025-02-08 08:38:25,776 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:38:25,777 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 212 flow [2025-02-08 08:38:25,777 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:38:25,777 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:38:25,777 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 212 flow [2025-02-08 08:38:25,777 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:38:25,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:25,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:25,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:38:25,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:38:25,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash -905635728, now seen corresponding path program 1 times [2025-02-08 08:38:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-02-08 08:38:25,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:25,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:25,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:25,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:25,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:38:25,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:25,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-02-08 08:38:25,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549453840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:25,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:25,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896342600] [2025-02-08 08:38:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:25,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:25,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:25,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:25,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:25,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 212 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:38:25,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:25,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:25,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:26,933 INFO L124 PetriNetUnfolderBase]: 12600/17396 cut-off events. [2025-02-08 08:38:26,933 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-02-08 08:38:26,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37054 conditions, 17396 events. 12600/17396 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 105811 event pairs, 11474 based on Foata normal form. 0/13262 useless extension candidates. Maximal degree in co-relation 29179. Up to 16964 conditions per place. [2025-02-08 08:38:27,036 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 48 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2025-02-08 08:38:27,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 316 flow [2025-02-08 08:38:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-02-08 08:38:27,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-02-08 08:38:27,037 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 212 flow. Second operand 5 states and 124 transitions. [2025-02-08 08:38:27,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 316 flow [2025-02-08 08:38:27,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 65 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:27,040 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 215 flow [2025-02-08 08:38:27,040 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-02-08 08:38:27,040 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:38:27,040 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 215 flow [2025-02-08 08:38:27,041 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:38:27,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:27,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:38:27,041 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:38:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2088855341, now seen corresponding path program 1 times [2025-02-08 08:38:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038775366] [2025-02-08 08:38:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:27,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:27,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:27,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:27,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038775366] [2025-02-08 08:38:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038775366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:27,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:27,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:27,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676164234] [2025-02-08 08:38:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:27,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:27,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:27,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:27,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:27,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 215 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:38:27,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:27,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:27,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:27,959 INFO L124 PetriNetUnfolderBase]: 9174/12764 cut-off events. [2025-02-08 08:38:27,959 INFO L125 PetriNetUnfolderBase]: For 883/883 co-relation queries the response was YES. [2025-02-08 08:38:27,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27216 conditions, 12764 events. 9174/12764 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 75188 event pairs, 8266 based on Foata normal form. 0/10410 useless extension candidates. Maximal degree in co-relation 21366. Up to 12400 conditions per place. [2025-02-08 08:38:28,037 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 49 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2025-02-08 08:38:28,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 319 flow [2025-02-08 08:38:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-08 08:38:28,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2025-02-08 08:38:28,038 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 215 flow. Second operand 4 states and 106 transitions. [2025-02-08 08:38:28,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 319 flow [2025-02-08 08:38:28,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 307 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:28,041 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 209 flow [2025-02-08 08:38:28,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=199, 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=209, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2025-02-08 08:38:28,042 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-02-08 08:38:28,042 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 209 flow [2025-02-08 08:38:28,042 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:38:28,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:28,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:28,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:38:28,042 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:38:28,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2088855342, now seen corresponding path program 1 times [2025-02-08 08:38:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-02-08 08:38:28,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:28,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:28,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:28,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:28,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:28,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:28,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-02-08 08:38:28,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442142527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:28,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:28,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981080209] [2025-02-08 08:38:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:28,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:28,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:28,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:28,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:28,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:38:28,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 209 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:38:28,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:28,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:38:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:29,006 INFO L124 PetriNetUnfolderBase]: 11787/16699 cut-off events. [2025-02-08 08:38:29,006 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-02-08 08:38:29,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35606 conditions, 16699 events. 11787/16699 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 104353 event pairs, 10753 based on Foata normal form. 500/14892 useless extension candidates. Maximal degree in co-relation 21388. Up to 12416 conditions per place. [2025-02-08 08:38:29,068 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 74 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2025-02-08 08:38:29,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 441 flow [2025-02-08 08:38:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-02-08 08:38:29,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2025-02-08 08:38:29,069 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 209 flow. Second operand 4 states and 146 transitions. [2025-02-08 08:38:29,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 441 flow [2025-02-08 08:38:29,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:29,071 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 227 flow [2025-02-08 08:38:29,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=203, 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=227, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-02-08 08:38:29,072 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:38:29,072 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 227 flow [2025-02-08 08:38:29,072 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:38:29,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:29,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:29,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:38:29,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:38:29,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -905635727, now seen corresponding path program 1 times [2025-02-08 08:38:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-02-08 08:38:29,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:29,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:29,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:29,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:29,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:29,233 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:38:29,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-02-08 08:38:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917816429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636927588] [2025-02-08 08:38:29,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:29,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:29,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:29,237 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:38:29,238 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:38:29,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:29,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:29,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:29,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:29,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 08:38:29,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:29,315 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:38:29,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:38:29,363 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:38:29,377 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:38:29,377 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:38:29,400 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:38:29,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:38:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636927588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:29,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:38:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-02-08 08:38:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557117003] [2025-02-08 08:38:29,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:29,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:29,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:29,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:38:29,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-02-08 08:38:29,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 227 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:38:29,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:29,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-02-08 08:38:29,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:29,929 INFO L124 PetriNetUnfolderBase]: 8716/12455 cut-off events. [2025-02-08 08:38:29,929 INFO L125 PetriNetUnfolderBase]: For 1789/1789 co-relation queries the response was YES. [2025-02-08 08:38:29,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27447 conditions, 12455 events. 8716/12455 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 75427 event pairs, 7905 based on Foata normal form. 0/11254 useless extension candidates. Maximal degree in co-relation 15012. Up to 12044 conditions per place. [2025-02-08 08:38:29,983 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 48 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-02-08 08:38:29,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 323 flow [2025-02-08 08:38:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-08 08:38:29,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-02-08 08:38:29,985 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 227 flow. Second operand 4 states and 104 transitions. [2025-02-08 08:38:29,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 323 flow [2025-02-08 08:38:29,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 61 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:29,988 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 222 flow [2025-02-08 08:38:29,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-02-08 08:38:29,989 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:38:29,989 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 222 flow [2025-02-08 08:38:29,989 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:38:29,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:29,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:29,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:38:30,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:30,192 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:38:30,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1488307797, now seen corresponding path program 1 times [2025-02-08 08:38:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:30,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949345827] [2025-02-08 08:38:30,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:30,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:38:30,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:38:30,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:30,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:30,353 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:38:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949345827] [2025-02-08 08:38:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949345827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665776012] [2025-02-08 08:38:30,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:30,356 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:38:30,358 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:38:30,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:38:30,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:38:30,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:30,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:30,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:38:30,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:30,477 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:38:30,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:38:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665776012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:38:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-08 08:38:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396729130] [2025-02-08 08:38:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:30,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:30,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:30,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:38:30,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:38:30,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 222 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:38:30,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:30,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:38:30,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:30,914 INFO L124 PetriNetUnfolderBase]: 6585/9541 cut-off events. [2025-02-08 08:38:30,915 INFO L125 PetriNetUnfolderBase]: For 1452/1452 co-relation queries the response was YES. [2025-02-08 08:38:30,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20495 conditions, 9541 events. 6585/9541 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 56741 event pairs, 5929 based on Foata normal form. 0/9195 useless extension candidates. Maximal degree in co-relation 14443. Up to 9165 conditions per place. [2025-02-08 08:38:30,955 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 41 selfloop transitions, 7 changer transitions 2/59 dead transitions. [2025-02-08 08:38:30,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 314 flow [2025-02-08 08:38:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-08 08:38:30,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2025-02-08 08:38:30,956 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 222 flow. Second operand 4 states and 110 transitions. [2025-02-08 08:38:30,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 314 flow [2025-02-08 08:38:30,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 59 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:30,958 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 215 flow [2025-02-08 08:38:30,959 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:38:30,959 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-08 08:38:30,959 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 215 flow [2025-02-08 08:38:30,959 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:38:30,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:30,959 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:38:30,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:38:31,162 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:38:31,163 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:38:31,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash -589096818, now seen corresponding path program 1 times [2025-02-08 08:38:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:31,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272301010] [2025-02-08 08:38:31,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:31,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:38:31,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:38:31,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:31,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:31,289 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:38:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272301010] [2025-02-08 08:38:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272301010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:31,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:31,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:31,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746850499] [2025-02-08 08:38:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:31,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:31,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:31,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:31,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:31,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:38:31,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:31,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:31,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:38:31,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:31,681 INFO L124 PetriNetUnfolderBase]: 4899/7655 cut-off events. [2025-02-08 08:38:31,682 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2025-02-08 08:38:31,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15630 conditions, 7655 events. 4899/7655 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 48386 event pairs, 620 based on Foata normal form. 424/8031 useless extension candidates. Maximal degree in co-relation 12554. Up to 3532 conditions per place. [2025-02-08 08:38:31,699 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 73 selfloop transitions, 6 changer transitions 3/91 dead transitions. [2025-02-08 08:38:31,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 459 flow [2025-02-08 08:38:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2025-02-08 08:38:31,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.496875 [2025-02-08 08:38:31,700 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 215 flow. Second operand 5 states and 159 transitions. [2025-02-08 08:38:31,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 459 flow [2025-02-08 08:38:31,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:31,702 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 196 flow [2025-02-08 08:38:31,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2025-02-08 08:38:31,703 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-08 08:38:31,703 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 196 flow [2025-02-08 08:38:31,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:31,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:31,703 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, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:31,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:38:31,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:38:31,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1303844610, now seen corresponding path program 1 times [2025-02-08 08:38:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698031015] [2025-02-08 08:38:31,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:31,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:38:31,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:38:31,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:31,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:31,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698031015] [2025-02-08 08:38:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698031015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:31,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:31,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:31,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595825607] [2025-02-08 08:38:31,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:31,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:31,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:31,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:31,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:31,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:38:31,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:31,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:31,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:38:31,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:32,232 INFO L124 PetriNetUnfolderBase]: 3992/6355 cut-off events. [2025-02-08 08:38:32,232 INFO L125 PetriNetUnfolderBase]: For 1524/1524 co-relation queries the response was YES. [2025-02-08 08:38:32,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13954 conditions, 6355 events. 3992/6355 cut-off events. For 1524/1524 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 39586 event pairs, 818 based on Foata normal form. 478/6799 useless extension candidates. Maximal degree in co-relation 13915. Up to 3404 conditions per place. [2025-02-08 08:38:32,255 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 56 selfloop transitions, 5 changer transitions 30/100 dead transitions. [2025-02-08 08:38:32,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 497 flow [2025-02-08 08:38:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2025-02-08 08:38:32,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2025-02-08 08:38:32,256 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 196 flow. Second operand 6 states and 190 transitions. [2025-02-08 08:38:32,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 497 flow [2025-02-08 08:38:32,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 473 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-08 08:38:32,262 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 200 flow [2025-02-08 08:38:32,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-02-08 08:38:32,262 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2025-02-08 08:38:32,262 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 200 flow [2025-02-08 08:38:32,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:32,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:32,263 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, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:32,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:38:32,263 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:38:32,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 97626282, now seen corresponding path program 2 times [2025-02-08 08:38:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351345417] [2025-02-08 08:38:32,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:38:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:32,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:38:32,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-02-08 08:38:32,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:38:32,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:38:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351345417] [2025-02-08 08:38:32,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351345417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:32,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:38:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386283618] [2025-02-08 08:38:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:32,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:38:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:32,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:38:32,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:38:32,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-02-08 08:38:32,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:32,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:32,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-02-08 08:38:32,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:32,621 INFO L124 PetriNetUnfolderBase]: 2020/3358 cut-off events. [2025-02-08 08:38:32,621 INFO L125 PetriNetUnfolderBase]: For 947/947 co-relation queries the response was YES. [2025-02-08 08:38:32,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7526 conditions, 3358 events. 2020/3358 cut-off events. For 947/947 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19600 event pairs, 222 based on Foata normal form. 286/3624 useless extension candidates. Maximal degree in co-relation 7518. Up to 1385 conditions per place. [2025-02-08 08:38:32,629 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 0 selfloop transitions, 0 changer transitions 81/81 dead transitions. [2025-02-08 08:38:32,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 406 flow [2025-02-08 08:38:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-02-08 08:38:32,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-02-08 08:38:32,631 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 200 flow. Second operand 5 states and 152 transitions. [2025-02-08 08:38:32,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 406 flow [2025-02-08 08:38:32,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:32,632 INFO L231 Difference]: Finished difference. Result has 64 places, 0 transitions, 0 flow [2025-02-08 08:38:32,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=64, PETRI_TRANSITIONS=0} [2025-02-08 08:38:32,632 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-02-08 08:38:32,632 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 0 transitions, 0 flow [2025-02-08 08:38:32,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:32,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (15 of 26 remaining) [2025-02-08 08:38:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-02-08 08:38:32,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-02-08 08:38:32,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:38:32,638 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:32,643 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:38:32,643 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:38:32,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:38:32 BasicIcfg [2025-02-08 08:38:32,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:38:32,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:38:32,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:38:32,650 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:38:32,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:15" (3/4) ... [2025-02-08 08:38:32,652 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:38:32,654 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:38:32,654 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:38:32,654 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:38:32,654 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 08:38:32,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2025-02-08 08:38:32,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2025-02-08 08:38:32,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-02-08 08:38:32,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 08:38:32,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:38:32,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:38:32,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:38:32,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:38:32,730 INFO L158 Benchmark]: Toolchain (without parser) took 18874.38ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 109.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 989.8MB. Max. memory is 16.1GB. [2025-02-08 08:38:32,730 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:38:32,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.78ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 96.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:38:32,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.82ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:38:32,731 INFO L158 Benchmark]: Boogie Preprocessor took 51.36ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:38:32,731 INFO L158 Benchmark]: IcfgBuilder took 857.43ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 79.1MB in the end (delta: 12.4MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-02-08 08:38:32,731 INFO L158 Benchmark]: TraceAbstraction took 17598.41ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 78.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 958.1MB. Max. memory is 16.1GB. [2025-02-08 08:38:32,731 INFO L158 Benchmark]: Witness Printer took 79.69ms. Allocated memory is still 3.0GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:38:32,732 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.78ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 96.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.82ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.36ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 857.43ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 79.1MB in the end (delta: 12.4MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17598.41ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 78.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 958.1MB. Max. memory is 16.1GB. * Witness Printer took 79.69ms. Allocated memory is still 3.0GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 123]: 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: 17.5s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 617 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2212 IncrementalHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 16 mSDtfsCounter, 2212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=9, InterpolantAutomatonStates: 69, 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.6s InterpolantComputationTime, 213 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 204 ConstructedInterpolants, 3 QuantifiedInterpolants, 1952 SizeOfPredicates, 11 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 31/45 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:38:32,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE