./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-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-three-array-sum-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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:38:46,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:38:46,547 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:46,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:38:46,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:38:46,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:38:46,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:38:46,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:38:46,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:38:46,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:38:46,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:38:46,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:38:46,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:38:46,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:38:46,566 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:38:46,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:38:46,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:38:46,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:38:46,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:46,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:38:46,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:38:46,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:38:46,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:38:46,569 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-02-08 08:38:46,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:38:46,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:38:46,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:38:46,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:38:46,765 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:38:46,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 08:38:47,961 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3e81aff5/6b070dfc0d0d4442913574f2a53ac475/FLAG025d1579f [2025-02-08 08:38:48,249 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:38:48,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 08:38:48,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3e81aff5/6b070dfc0d0d4442913574f2a53ac475/FLAG025d1579f [2025-02-08 08:38:48,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3e81aff5/6b070dfc0d0d4442913574f2a53ac475 [2025-02-08 08:38:48,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:38:48,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:38:48,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:48,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:38:48,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:38:48,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:48" (1/1) ... [2025-02-08 08:38:48,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689ed7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:48, skipping insertion in model container [2025-02-08 08:38:48,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:48" (1/1) ... [2025-02-08 08:38:48,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:38:48,414 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:48,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:48,429 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:38:48,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:48,468 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:38:48,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:48 WrapperNode [2025-02-08 08:38:48,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:48,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:48,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:38:48,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:38:48,476 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:48" (1/1) ... [2025-02-08 08:38:48,484 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:48" (1/1) ... [2025-02-08 08:38:48,512 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-02-08 08:38:48,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:48,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:38:48,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:38:48,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:38:48,525 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:48" (1/1) ... [2025-02-08 08:38:48,526 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:48" (1/1) ... [2025-02-08 08:38:48,528 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:48" (1/1) ... [2025-02-08 08:38:48,548 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-08 08:38:48,548 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:48" (1/1) ... [2025-02-08 08:38:48,549 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:48" (1/1) ... [2025-02-08 08:38:48,557 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:48" (1/1) ... [2025-02-08 08:38:48,558 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:48" (1/1) ... [2025-02-08 08:38:48,559 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:48" (1/1) ... [2025-02-08 08:38:48,560 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:48" (1/1) ... [2025-02-08 08:38:48,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:38:48,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:38:48,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:38:48,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:38:48,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:48" (1/1) ... [2025-02-08 08:38:48,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:48,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:48,588 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:48,597 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:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:38:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:38:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:38:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:38:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:38:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:38:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:38:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:38:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:38:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:38:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:38:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:38:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:38:48,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:38:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:38:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:38:48,619 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:48,715 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:38:48,716 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:38:48,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-1: havoc #t~post3#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-2: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-3: #t~post3#1 := ~i~0#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51: havoc #t~ret2#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-1: havoc #t~mem1#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-2: ~asum~0 := #t~ret2#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:48,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-6: #t~ret2#1 := plus_#res#1; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-1: havoc #t~post6#1; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: #t~post6#1 := ~i~1#1; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~ret5#1; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: havoc #t~mem4#1; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: ~bsum~0 := #t~ret5#1; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 08:38:48,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:38:48,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:48,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-6: #t~ret5#1 := plus_#res#1; [2025-02-08 08:38:48,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 08:38:48,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:38:48,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:48,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: #t~ret11#1 := plus_#res#1; [2025-02-08 08:38:48,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:48,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: havoc plus_#res#1; [2025-02-08 08:38:48,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~csum~0, #t~mem10#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: SUMMARY for call #t~mem10#1 := read~int#1(~C~0.base, ~C~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: assume !(1 == #valid[~C~0.base]); [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: assume !(4 + (~C~0.offset + 4 * ~i~2#1) <= #length[~C~0.base] && 0 <= ~C~0.offset + 4 * ~i~2#1); [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~post12#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: ~i~2#1 := 1 + #t~post12#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: #t~post12#1 := ~i~2#1; [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:38:48,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-1: assume false; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-3: assume false; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: havoc #t~ret9#1; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-1: havoc #t~mem8#1; [2025-02-08 08:38:48,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-2: havoc #t~mem7#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: SUMMARY for call write~int#1(#t~ret9#1, ~C~0.base, ~C~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: assume !(1 == #valid[~C~0.base]); [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: assume !(4 + (~C~0.offset + 4 * ~i~2#1) <= #length[~C~0.base] && 0 <= ~C~0.offset + 4 * ~i~2#1); [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-4: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-5: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-6: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-7: #t~ret9#1 := plus_#res#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:38:48,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~ret11#1; [2025-02-08 08:38:48,917 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~mem10#1; [2025-02-08 08:38:48,917 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: ~csum~0 := #t~ret11#1; [2025-02-08 08:38:49,081 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:38:49,082 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:38:49,297 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:38:49,298 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:38:49,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:49 BoogieIcfgContainer [2025-02-08 08:38:49,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:38:49,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:38:49,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:38:49,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:38:49,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:38:48" (1/3) ... [2025-02-08 08:38:49,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbb047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:49, skipping insertion in model container [2025-02-08 08:38:49,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:48" (2/3) ... [2025-02-08 08:38:49,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbb047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:49, skipping insertion in model container [2025-02-08 08:38:49,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:49" (3/3) ... [2025-02-08 08:38:49,307 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 08:38:49,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:38:49,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 52 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-02-08 08:38:49,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:38:49,374 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:38:49,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 54 transitions, 129 flow [2025-02-08 08:38:49,430 INFO L124 PetriNetUnfolderBase]: 3/51 cut-off events. [2025-02-08 08:38:49,434 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:38:49,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 3/51 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-02-08 08:38:49,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 54 transitions, 129 flow [2025-02-08 08:38:49,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 50 transitions, 118 flow [2025-02-08 08:38:49,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:38:49,460 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;@4d6ed202, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:38:49,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 08:38:49,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:38:49,466 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:38:49,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:38:49,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:49,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:49,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash 710904, now seen corresponding path program 1 times [2025-02-08 08:38:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:49,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298071126] [2025-02-08 08:38:49,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:49,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:49,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:49,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:49,653 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:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298071126] [2025-02-08 08:38:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298071126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:49,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:49,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:38:49,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575122397] [2025-02-08 08:38:49,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:49,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:49,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:49,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:49,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-02-08 08:38:49,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:49,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:49,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-02-08 08:38:49,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:49,874 INFO L124 PetriNetUnfolderBase]: 309/633 cut-off events. [2025-02-08 08:38:49,874 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 08:38:49,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 633 events. 309/633 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3450 event pairs, 306 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 1055. Up to 498 conditions per place. [2025-02-08 08:38:49,882 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-02-08 08:38:49,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 166 flow [2025-02-08 08:38:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-08 08:38:49,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-02-08 08:38:49,892 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 118 flow. Second operand 3 states and 93 transitions. [2025-02-08 08:38:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 166 flow [2025-02-08 08:38:49,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:38:49,898 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 100 flow [2025-02-08 08:38:49,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-02-08 08:38:49,902 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2025-02-08 08:38:49,902 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 100 flow [2025-02-08 08:38:49,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:49,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:49,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:49,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:38:49,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:49,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:49,904 INFO L85 PathProgramCache]: Analyzing trace with hash 710905, now seen corresponding path program 1 times [2025-02-08 08:38:49,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:49,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158786342] [2025-02-08 08:38:49,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:49,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:49,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:49,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:50,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158786342] [2025-02-08 08:38:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158786342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:50,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:50,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:50,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276541652] [2025-02-08 08:38:50,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:50,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:50,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:50,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:50,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:50,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-02-08 08:38:50,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:50,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:50,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-02-08 08:38:50,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:50,351 INFO L124 PetriNetUnfolderBase]: 310/636 cut-off events. [2025-02-08 08:38:50,351 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:38:50,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 636 events. 310/636 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3458 event pairs, 306 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 1137. Up to 511 conditions per place. [2025-02-08 08:38:50,357 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 31 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-02-08 08:38:50,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 176 flow [2025-02-08 08:38:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-08 08:38:50,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-02-08 08:38:50,362 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 100 flow. Second operand 4 states and 116 transitions. [2025-02-08 08:38:50,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 176 flow [2025-02-08 08:38:50,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:50,364 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 123 flow [2025-02-08 08:38:50,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-02-08 08:38:50,364 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places. [2025-02-08 08:38:50,364 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 123 flow [2025-02-08 08:38:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:50,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:50,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:38:50,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:38:50,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:50,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash 22039828, now seen corresponding path program 1 times [2025-02-08 08:38:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582594270] [2025-02-08 08:38:50,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:50,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:38:50,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:38:50,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:50,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:50,494 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:50,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:50,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582594270] [2025-02-08 08:38:50,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582594270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:50,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361222364] [2025-02-08 08:38:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:50,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:50,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:50,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:50,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2025-02-08 08:38:50,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:50,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:50,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2025-02-08 08:38:50,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:50,704 INFO L124 PetriNetUnfolderBase]: 312/646 cut-off events. [2025-02-08 08:38:50,704 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:38:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 646 events. 312/646 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3512 event pairs, 306 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 1148. Up to 509 conditions per place. [2025-02-08 08:38:50,710 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 30 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2025-02-08 08:38:50,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 219 flow [2025-02-08 08:38:50,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-02-08 08:38:50,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-02-08 08:38:50,711 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 123 flow. Second operand 4 states and 134 transitions. [2025-02-08 08:38:50,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 219 flow [2025-02-08 08:38:50,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:50,713 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 176 flow [2025-02-08 08:38:50,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2025-02-08 08:38:50,714 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2025-02-08 08:38:50,714 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 176 flow [2025-02-08 08:38:50,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:50,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:50,714 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:38:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:38:50,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:50,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 683202534, now seen corresponding path program 1 times [2025-02-08 08:38:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188972345] [2025-02-08 08:38:50,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:50,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:38:50,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:38:50,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:50,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:50,894 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:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:50,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188972345] [2025-02-08 08:38:50,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188972345] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255503885] [2025-02-08 08:38:50,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:50,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:50,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:50,898 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:50,910 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:50,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:38:50,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:38:50,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:50,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:50,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:38:50,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:51,015 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:51,195 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:51,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:51,284 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:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255503885] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:51,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:51,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:38:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207495536] [2025-02-08 08:38:51,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:51,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:38:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:51,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:38:51,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:38:51,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-02-08 08:38:51,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 176 flow. Second operand has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 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:51,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:51,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-02-08 08:38:51,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:51,651 INFO L124 PetriNetUnfolderBase]: 313/648 cut-off events. [2025-02-08 08:38:51,652 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:38:51,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 648 events. 313/648 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3534 event pairs, 306 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 1153. Up to 518 conditions per place. [2025-02-08 08:38:51,655 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 33 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2025-02-08 08:38:51,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 56 transitions, 273 flow [2025-02-08 08:38:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:38:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:38:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2025-02-08 08:38:51,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46064814814814814 [2025-02-08 08:38:51,657 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 176 flow. Second operand 8 states and 199 transitions. [2025-02-08 08:38:51,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 56 transitions, 273 flow [2025-02-08 08:38:51,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:38:51,658 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 207 flow [2025-02-08 08:38:51,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-08 08:38:51,659 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2025-02-08 08:38:51,659 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 207 flow [2025-02-08 08:38:51,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 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:51,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:51,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:38:51,670 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:51,860 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:51,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:51,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -295556153, now seen corresponding path program 1 times [2025-02-08 08:38:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:51,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282872303] [2025-02-08 08:38:51,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:51,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:38:51,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:38:51,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:52,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282872303] [2025-02-08 08:38:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282872303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980569165] [2025-02-08 08:38:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:52,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:52,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:52,182 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:52,183 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:52,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:38:52,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:38:52,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:52,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:52,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:38:52,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:52,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:38:52,320 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:38:52,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-02-08 08:38:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:52,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:52,400 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:52,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980569165] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:52,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:38:52,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-02-08 08:38:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715033384] [2025-02-08 08:38:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:52,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:52,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:52,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:38:52,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-02-08 08:38:52,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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:52,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:52,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-02-08 08:38:52,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:52,652 INFO L124 PetriNetUnfolderBase]: 618/1267 cut-off events. [2025-02-08 08:38:52,652 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 08:38:52,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 1267 events. 618/1267 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8125 event pairs, 612 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 1194. Up to 512 conditions per place. [2025-02-08 08:38:52,659 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 55 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2025-02-08 08:38:52,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 394 flow [2025-02-08 08:38:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-02-08 08:38:52,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6037037037037037 [2025-02-08 08:38:52,660 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 207 flow. Second operand 5 states and 163 transitions. [2025-02-08 08:38:52,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 394 flow [2025-02-08 08:38:52,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 352 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 08:38:52,662 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 201 flow [2025-02-08 08:38:52,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-02-08 08:38:52,662 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-08 08:38:52,662 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 201 flow [2025-02-08 08:38:52,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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:52,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:52,662 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:52,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:38:52,867 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:52,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:52,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash -561598179, now seen corresponding path program 1 times [2025-02-08 08:38:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066479274] [2025-02-08 08:38:52,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:38:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:38:52,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066479274] [2025-02-08 08:38:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066479274] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754960920] [2025-02-08 08:38:52,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:53,004 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:53,006 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:53,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:38:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:38:53,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:53,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:53,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:38:53,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:53,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754960920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:53,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 08:38:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725636263] [2025-02-08 08:38:53,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:53,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:38:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:53,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:38:53,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:38:53,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2025-02-08 08:38:53,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 201 flow. Second operand has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 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:53,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:53,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2025-02-08 08:38:53,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:53,599 INFO L124 PetriNetUnfolderBase]: 927/1903 cut-off events. [2025-02-08 08:38:53,599 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 08:38:53,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1903 events. 927/1903 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11815 event pairs, 918 based on Foata normal form. 2/1668 useless extension candidates. Maximal degree in co-relation 1168. Up to 998 conditions per place. [2025-02-08 08:38:53,610 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 48 selfloop transitions, 29 changer transitions 0/92 dead transitions. [2025-02-08 08:38:53,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 485 flow [2025-02-08 08:38:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:38:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:38:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 285 transitions. [2025-02-08 08:38:53,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5864197530864198 [2025-02-08 08:38:53,611 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 201 flow. Second operand 9 states and 285 transitions. [2025-02-08 08:38:53,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 485 flow [2025-02-08 08:38:53,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:53,615 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 353 flow [2025-02-08 08:38:53,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2025-02-08 08:38:53,616 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2025-02-08 08:38:53,616 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 353 flow [2025-02-08 08:38:53,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 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:53,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:53,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:53,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:38:53,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:53,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:53,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:53,822 INFO L85 PathProgramCache]: Analyzing trace with hash 447672960, now seen corresponding path program 1 times [2025-02-08 08:38:53,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:53,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352274830] [2025-02-08 08:38:53,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:53,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:38:53,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:38:53,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:53,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:53,877 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:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352274830] [2025-02-08 08:38:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352274830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857378393] [2025-02-08 08:38:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:53,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:53,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:53,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:53,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 54 [2025-02-08 08:38:53,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:53,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:53,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 54 [2025-02-08 08:38:53,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:54,132 INFO L124 PetriNetUnfolderBase]: 1232/2459 cut-off events. [2025-02-08 08:38:54,133 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 08:38:54,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2459 events. 1232/2459 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 15381 event pairs, 1064 based on Foata normal form. 0/2099 useless extension candidates. Maximal degree in co-relation 1717. Up to 1257 conditions per place. [2025-02-08 08:38:54,143 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 66 selfloop transitions, 20 changer transitions 0/100 dead transitions. [2025-02-08 08:38:54,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 607 flow [2025-02-08 08:38:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-02-08 08:38:54,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265432098765432 [2025-02-08 08:38:54,145 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 353 flow. Second operand 6 states and 203 transitions. [2025-02-08 08:38:54,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 607 flow [2025-02-08 08:38:54,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 537 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-02-08 08:38:54,147 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 341 flow [2025-02-08 08:38:54,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2025-02-08 08:38:54,148 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2025-02-08 08:38:54,148 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 341 flow [2025-02-08 08:38:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:54,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:54,148 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-08 08:38:54,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:38:54,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:54,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash 492043856, now seen corresponding path program 2 times [2025-02-08 08:38:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984591442] [2025-02-08 08:38:54,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:38:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:54,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:38:54,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:54,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:38:54,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:38:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984591442] [2025-02-08 08:38:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984591442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192045682] [2025-02-08 08:38:54,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:38:54,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:54,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:54,331 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:54,332 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:54,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:38:54,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:54,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:38:54,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:54,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:38:54,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:54,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:38:54,486 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:38:54,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-02-08 08:38:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:38:54,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:38:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192045682] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:54,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-02-08 08:38:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916981225] [2025-02-08 08:38:54,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:54,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:38:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:54,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:38:54,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:38:55,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-02-08 08:38:55,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 341 flow. Second operand has 16 states, 16 states have (on average 21.75) internal successors, (348), 16 states have internal predecessors, (348), 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:55,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:55,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-02-08 08:38:55,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:55,824 INFO L124 PetriNetUnfolderBase]: 1600/3325 cut-off events. [2025-02-08 08:38:55,824 INFO L125 PetriNetUnfolderBase]: For 1000/1078 co-relation queries the response was YES. [2025-02-08 08:38:55,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6989 conditions, 3325 events. 1600/3325 cut-off events. For 1000/1078 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23715 event pairs, 1596 based on Foata normal form. 6/2939 useless extension candidates. Maximal degree in co-relation 2469. Up to 1369 conditions per place. [2025-02-08 08:38:55,838 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 49 selfloop transitions, 30 changer transitions 0/92 dead transitions. [2025-02-08 08:38:55,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 567 flow [2025-02-08 08:38:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:38:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:38:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 278 transitions. [2025-02-08 08:38:55,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148148148148148 [2025-02-08 08:38:55,841 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 341 flow. Second operand 10 states and 278 transitions. [2025-02-08 08:38:55,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 567 flow [2025-02-08 08:38:55,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 92 transitions, 528 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:38:55,845 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 367 flow [2025-02-08 08:38:55,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=367, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-02-08 08:38:55,846 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2025-02-08 08:38:55,847 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 367 flow [2025-02-08 08:38:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 21.75) internal successors, (348), 16 states have internal predecessors, (348), 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:55,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:55,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:55,854 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:56,048 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,SelfDestructingSolverStorable7 [2025-02-08 08:38:56,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 714865549, now seen corresponding path program 1 times [2025-02-08 08:38:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408375262] [2025-02-08 08:38:56,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:56,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:56,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:56,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:56,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:56,103 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:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408375262] [2025-02-08 08:38:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408375262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075408752] [2025-02-08 08:38:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:56,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:56,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:56,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:56,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 54 [2025-02-08 08:38:56,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 367 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:56,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:56,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 54 [2025-02-08 08:38:56,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:56,378 INFO L124 PetriNetUnfolderBase]: 1666/3226 cut-off events. [2025-02-08 08:38:56,378 INFO L125 PetriNetUnfolderBase]: For 949/1099 co-relation queries the response was YES. [2025-02-08 08:38:56,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6905 conditions, 3226 events. 1666/3226 cut-off events. For 949/1099 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 21386 event pairs, 1473 based on Foata normal form. 0/2760 useless extension candidates. Maximal degree in co-relation 3035. Up to 1896 conditions per place. [2025-02-08 08:38:56,395 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 63 selfloop transitions, 18 changer transitions 2/95 dead transitions. [2025-02-08 08:38:56,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 617 flow [2025-02-08 08:38:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2025-02-08 08:38:56,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2025-02-08 08:38:56,397 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 367 flow. Second operand 6 states and 200 transitions. [2025-02-08 08:38:56,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 617 flow [2025-02-08 08:38:56,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 95 transitions, 541 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-02-08 08:38:56,400 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 349 flow [2025-02-08 08:38:56,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-02-08 08:38:56,401 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2025-02-08 08:38:56,402 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 349 flow [2025-02-08 08:38:56,402 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:56,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:56,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:56,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:38:56,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -217618217, now seen corresponding path program 1 times [2025-02-08 08:38:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626531947] [2025-02-08 08:38:56,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:56,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:38:56,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:38:56,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:56,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:56,453 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:56,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:56,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626531947] [2025-02-08 08:38:56,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626531947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:56,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:56,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:56,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343432725] [2025-02-08 08:38:56,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:56,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:56,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:56,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:56,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:56,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 54 [2025-02-08 08:38:56,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:56,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:56,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 54 [2025-02-08 08:38:56,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:56,716 INFO L124 PetriNetUnfolderBase]: 1387/2814 cut-off events. [2025-02-08 08:38:56,717 INFO L125 PetriNetUnfolderBase]: For 1273/1552 co-relation queries the response was YES. [2025-02-08 08:38:56,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6345 conditions, 2814 events. 1387/2814 cut-off events. For 1273/1552 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 19013 event pairs, 1304 based on Foata normal form. 0/2384 useless extension candidates. Maximal degree in co-relation 3999. Up to 1836 conditions per place. [2025-02-08 08:38:56,728 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 62 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2025-02-08 08:38:56,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 587 flow [2025-02-08 08:38:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2025-02-08 08:38:56,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6080246913580247 [2025-02-08 08:38:56,730 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 349 flow. Second operand 6 states and 197 transitions. [2025-02-08 08:38:56,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 587 flow [2025-02-08 08:38:56,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 92 transitions, 559 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:56,734 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 375 flow [2025-02-08 08:38:56,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-02-08 08:38:56,735 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2025-02-08 08:38:56,735 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 375 flow [2025-02-08 08:38:56,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:56,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:56,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:56,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:38:56,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:56,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash -152788670, now seen corresponding path program 1 times [2025-02-08 08:38:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778814593] [2025-02-08 08:38:56,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:38:56,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:38:56,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:56,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:56,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:56,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778814593] [2025-02-08 08:38:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778814593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675680592] [2025-02-08 08:38:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:56,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:56,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:56,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 54 [2025-02-08 08:38:56,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:56,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:56,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 54 [2025-02-08 08:38:56,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:57,128 INFO L124 PetriNetUnfolderBase]: 1387/2910 cut-off events. [2025-02-08 08:38:57,128 INFO L125 PetriNetUnfolderBase]: For 1557/1797 co-relation queries the response was YES. [2025-02-08 08:38:57,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7007 conditions, 2910 events. 1387/2910 cut-off events. For 1557/1797 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 20178 event pairs, 1382 based on Foata normal form. 0/2747 useless extension candidates. Maximal degree in co-relation 4408. Up to 2254 conditions per place. [2025-02-08 08:38:57,138 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 50 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2025-02-08 08:38:57,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 71 transitions, 493 flow [2025-02-08 08:38:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-02-08 08:38:57,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-02-08 08:38:57,139 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 375 flow. Second operand 5 states and 117 transitions. [2025-02-08 08:38:57,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 71 transitions, 493 flow [2025-02-08 08:38:57,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 465 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:57,141 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 365 flow [2025-02-08 08:38:57,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-02-08 08:38:57,142 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2025-02-08 08:38:57,142 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 365 flow [2025-02-08 08:38:57,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:57,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:57,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:57,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:38:57,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:38:57,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash -152788669, now seen corresponding path program 1 times [2025-02-08 08:38:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:57,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597408204] [2025-02-08 08:38:57,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:57,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:57,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:38:57,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:38:57,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:57,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:38:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597408204] [2025-02-08 08:38:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597408204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011330537] [2025-02-08 08:38:57,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:57,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:38:57,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:38:57,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:38:57,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:38:57,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:57,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:57,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 08:38:57,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:57,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:38:57,561 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:57,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:38:57,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:38:57,641 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:57,743 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-02-08 08:38:57,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-02-08 08:38:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:58,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011330537] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:58,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:38:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2025-02-08 08:38:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332245360] [2025-02-08 08:38:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:38:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:58,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:38:58,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:38:58,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 54 [2025-02-08 08:38:58,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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:58,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:58,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 54 [2025-02-08 08:38:58,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:39:02,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:39:02,825 INFO L124 PetriNetUnfolderBase]: 1294/2569 cut-off events. [2025-02-08 08:39:02,825 INFO L125 PetriNetUnfolderBase]: For 1722/1899 co-relation queries the response was YES. [2025-02-08 08:39:02,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 2569 events. 1294/2569 cut-off events. For 1722/1899 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16425 event pairs, 699 based on Foata normal form. 0/2433 useless extension candidates. Maximal degree in co-relation 3731. Up to 1051 conditions per place. [2025-02-08 08:39:02,833 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 73 selfloop transitions, 19 changer transitions 0/102 dead transitions. [2025-02-08 08:39:02,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 102 transitions, 673 flow [2025-02-08 08:39:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:39:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:39:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2025-02-08 08:39:02,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5687830687830688 [2025-02-08 08:39:02,837 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 365 flow. Second operand 7 states and 215 transitions. [2025-02-08 08:39:02,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 102 transitions, 673 flow [2025-02-08 08:39:02,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 658 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:39:02,841 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 415 flow [2025-02-08 08:39:02,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=415, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2025-02-08 08:39:02,843 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2025-02-08 08:39:02,843 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 415 flow [2025-02-08 08:39:02,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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:39:02,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:39:02,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:39:02,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:39:03,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 08:39:03,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:39:03,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:39:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash -803143216, now seen corresponding path program 1 times [2025-02-08 08:39:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:39:03,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269079658] [2025-02-08 08:39:03,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:39:03,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:39:03,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:39:03,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:03,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:39:03,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:39:03,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269079658] [2025-02-08 08:39:03,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269079658] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:39:03,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860883804] [2025-02-08 08:39:03,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:03,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:39:03,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:39:03,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:39:03,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:39:03,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:39:03,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:39:03,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:03,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:03,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:39:03,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:39:03,270 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:39:03,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:39:03,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 08:39:03,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:39:03,309 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:39:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:39:03,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:39:03,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-08 08:39:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:39:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860883804] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:39:03,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:39:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 08:39:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599219283] [2025-02-08 08:39:03,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:39:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:39:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:39:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:39:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:39:03,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2025-02-08 08:39:03,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 415 flow. Second operand has 13 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:39:03,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:39:03,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2025-02-08 08:39:03,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:39:04,242 INFO L124 PetriNetUnfolderBase]: 1294/2692 cut-off events. [2025-02-08 08:39:04,242 INFO L125 PetriNetUnfolderBase]: For 3763/3916 co-relation queries the response was YES. [2025-02-08 08:39:04,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7677 conditions, 2692 events. 1294/2692 cut-off events. For 3763/3916 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18468 event pairs, 684 based on Foata normal form. 0/2583 useless extension candidates. Maximal degree in co-relation 4283. Up to 1001 conditions per place. [2025-02-08 08:39:04,250 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 71 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2025-02-08 08:39:04,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 733 flow [2025-02-08 08:39:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:39:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:39:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2025-02-08 08:39:04,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2025-02-08 08:39:04,252 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 415 flow. Second operand 8 states and 218 transitions. [2025-02-08 08:39:04,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 733 flow [2025-02-08 08:39:04,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 101 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:39:04,256 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 481 flow [2025-02-08 08:39:04,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=481, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2025-02-08 08:39:04,256 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2025-02-08 08:39:04,257 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 481 flow [2025-02-08 08:39:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:39:04,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:39:04,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:39:04,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:39:04,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 08:39:04,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:39:04,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:39:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -803143217, now seen corresponding path program 1 times [2025-02-08 08:39:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:39:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780869693] [2025-02-08 08:39:04,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:39:04,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:39:04,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:39:04,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:04,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:39:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:39:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780869693] [2025-02-08 08:39:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780869693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:39:04,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:39:04,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:39:04,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53343035] [2025-02-08 08:39:04,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:39:04,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:39:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:39:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:39:04,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:39:04,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-02-08 08:39:04,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:39:04,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:39:04,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-02-08 08:39:04,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:39:04,716 INFO L124 PetriNetUnfolderBase]: 1294/2680 cut-off events. [2025-02-08 08:39:04,716 INFO L125 PetriNetUnfolderBase]: For 5401/5590 co-relation queries the response was YES. [2025-02-08 08:39:04,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8468 conditions, 2680 events. 1294/2680 cut-off events. For 5401/5590 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17641 event pairs, 1290 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 4737. Up to 2143 conditions per place. [2025-02-08 08:39:04,726 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 51 selfloop transitions, 12 changer transitions 1/71 dead transitions. [2025-02-08 08:39:04,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 71 transitions, 605 flow [2025-02-08 08:39:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:39:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:39:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-02-08 08:39:04,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2025-02-08 08:39:04,727 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 481 flow. Second operand 5 states and 121 transitions. [2025-02-08 08:39:04,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 71 transitions, 605 flow [2025-02-08 08:39:04,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 71 transitions, 587 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:39:04,733 INFO L231 Difference]: Finished difference. Result has 88 places, 70 transitions, 481 flow [2025-02-08 08:39:04,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=88, PETRI_TRANSITIONS=70} [2025-02-08 08:39:04,734 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2025-02-08 08:39:04,734 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 70 transitions, 481 flow [2025-02-08 08:39:04,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:39:04,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:39:04,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:39:04,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:39:04,735 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:39:04,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:39:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1264838297, now seen corresponding path program 1 times [2025-02-08 08:39:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:39:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670623759] [2025-02-08 08:39:04,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:39:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:39:04,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:39:04,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:04,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:39:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:39:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670623759] [2025-02-08 08:39:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670623759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:39:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687242542] [2025-02-08 08:39:05,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:39:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:39:05,074 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:39:05,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:39:05,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:39:05,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:39:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:05,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 08:39:05,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:39:05,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:39:05,163 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:39:05,235 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:39:05,236 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:39:05,256 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:39:05,392 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-02-08 08:39:05,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-02-08 08:39:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:39:05,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:39:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:39:10,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687242542] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:39:10,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:39:10,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2025-02-08 08:39:10,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133861930] [2025-02-08 08:39:10,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:39:10,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:39:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:39:10,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:39:10,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=249, Unknown=1, NotChecked=0, Total=306 [2025-02-08 08:39:10,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-02-08 08:39:10,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 70 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:39:10,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:39:10,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-02-08 08:39:10,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:39:12,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:39:14,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:39:16,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:39:16,227 INFO L124 PetriNetUnfolderBase]: 1294/2461 cut-off events. [2025-02-08 08:39:16,227 INFO L125 PetriNetUnfolderBase]: For 5744/5939 co-relation queries the response was YES. [2025-02-08 08:39:16,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8248 conditions, 2461 events. 1294/2461 cut-off events. For 5744/5939 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14700 event pairs, 780 based on Foata normal form. 0/2458 useless extension candidates. Maximal degree in co-relation 4588. Up to 1149 conditions per place. [2025-02-08 08:39:16,236 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 71 selfloop transitions, 19 changer transitions 0/95 dead transitions. [2025-02-08 08:39:16,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 789 flow [2025-02-08 08:39:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:39:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:39:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2025-02-08 08:39:16,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.544973544973545 [2025-02-08 08:39:16,238 INFO L175 Difference]: Start difference. First operand has 88 places, 70 transitions, 481 flow. Second operand 7 states and 206 transitions. [2025-02-08 08:39:16,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 789 flow [2025-02-08 08:39:16,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 772 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:39:16,243 INFO L231 Difference]: Finished difference. Result has 91 places, 71 transitions, 529 flow [2025-02-08 08:39:16,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=529, PETRI_PLACES=91, PETRI_TRANSITIONS=71} [2025-02-08 08:39:16,244 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2025-02-08 08:39:16,244 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 71 transitions, 529 flow [2025-02-08 08:39:16,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:39:16,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:39:16,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:39:16,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 08:39:16,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:39:16,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:39:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:39:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 555282201, now seen corresponding path program 1 times [2025-02-08 08:39:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:39:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388164179] [2025-02-08 08:39:16,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:39:16,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:39:16,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:39:16,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:39:16,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:39:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388164179] [2025-02-08 08:39:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388164179] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:39:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107202533] [2025-02-08 08:39:16,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:39:16,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:39:16,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:39:16,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:39:16,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:39:16,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:39:16,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:16,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:16,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 08:39:16,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:39:16,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:39:16,748 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:39:16,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2025-02-08 08:39:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:39:16,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:39:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:39:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107202533] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:39:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:39:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-02-08 08:39:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211558997] [2025-02-08 08:39:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:39:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:39:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:39:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:39:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:39:17,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 54 [2025-02-08 08:39:17,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 71 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:39:17,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:39:17,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 54 [2025-02-08 08:39:17,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:39:17,634 INFO L124 PetriNetUnfolderBase]: 1201/2357 cut-off events. [2025-02-08 08:39:17,635 INFO L125 PetriNetUnfolderBase]: For 6592/6730 co-relation queries the response was YES. [2025-02-08 08:39:17,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8872 conditions, 2357 events. 1201/2357 cut-off events. For 6592/6730 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 14003 event pairs, 865 based on Foata normal form. 111/2465 useless extension candidates. Maximal degree in co-relation 4873. Up to 1305 conditions per place. [2025-02-08 08:39:17,646 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 76 selfloop transitions, 18 changer transitions 4/103 dead transitions. [2025-02-08 08:39:17,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 913 flow [2025-02-08 08:39:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:39:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:39:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2025-02-08 08:39:17,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-02-08 08:39:17,648 INFO L175 Difference]: Start difference. First operand has 91 places, 71 transitions, 529 flow. Second operand 7 states and 213 transitions. [2025-02-08 08:39:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 103 transitions, 913 flow [2025-02-08 08:39:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 103 transitions, 888 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:39:17,659 INFO L231 Difference]: Finished difference. Result has 94 places, 70 transitions, 572 flow [2025-02-08 08:39:17,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=94, PETRI_TRANSITIONS=70} [2025-02-08 08:39:17,659 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2025-02-08 08:39:17,659 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 70 transitions, 572 flow [2025-02-08 08:39:17,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:39:17,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:39:17,660 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] [2025-02-08 08:39:17,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:39:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 08:39:17,861 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:39:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:39:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -590859181, now seen corresponding path program 1 times [2025-02-08 08:39:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:39:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-02-08 08:39:17,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:39:17,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:39:17,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:39:17,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:17,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:17,926 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:39:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:39:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-02-08 08:39:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143801541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:39:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:39:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:39:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897513962] [2025-02-08 08:39:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:39:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:39:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:39:17,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:39:17,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:39:17,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2025-02-08 08:39:17,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 70 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:39:17,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:39:17,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2025-02-08 08:39:17,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:39:18,028 INFO L124 PetriNetUnfolderBase]: 871/1725 cut-off events. [2025-02-08 08:39:18,028 INFO L125 PetriNetUnfolderBase]: For 7265/7367 co-relation queries the response was YES. [2025-02-08 08:39:18,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7657 conditions, 1725 events. 871/1725 cut-off events. For 7265/7367 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9194 event pairs, 868 based on Foata normal form. 7/1732 useless extension candidates. Maximal degree in co-relation 4232. Up to 1542 conditions per place. [2025-02-08 08:39:18,033 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2025-02-08 08:39:18,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 68 transitions, 696 flow [2025-02-08 08:39:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:39:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:39:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-08 08:39:18,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5864197530864198 [2025-02-08 08:39:18,034 INFO L175 Difference]: Start difference. First operand has 94 places, 70 transitions, 572 flow. Second operand 3 states and 95 transitions. [2025-02-08 08:39:18,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 68 transitions, 696 flow [2025-02-08 08:39:18,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 68 transitions, 687 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 08:39:18,045 INFO L231 Difference]: Finished difference. Result has 90 places, 0 transitions, 0 flow [2025-02-08 08:39:18,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=90, PETRI_TRANSITIONS=0} [2025-02-08 08:39:18,046 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2025-02-08 08:39:18,046 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 0 transitions, 0 flow [2025-02-08 08:39:18,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:39:18,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2025-02-08 08:39:18,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-02-08 08:39:18,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-02-08 08:39:18,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (12 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-02-08 08:39:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-02-08 08:39:18,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-02-08 08:39:18,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:39:18,051 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:39:18,054 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:39:18,055 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:39:18,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:39:18 BasicIcfg [2025-02-08 08:39:18,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:39:18,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:39:18,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:39:18,061 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:39:18,061 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:49" (3/4) ... [2025-02-08 08:39:18,062 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:39:18,064 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:39:18,064 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:39:18,064 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:39:18,071 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2025-02-08 08:39:18,071 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2025-02-08 08:39:18,071 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-08 08:39:18,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 08:39:18,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:39:18,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:39:18,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:39:18,176 INFO L158 Benchmark]: Toolchain (without parser) took 29898.07ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 109.2MB in the beginning and 367.4MB in the end (delta: -258.3MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2025-02-08 08:39:18,178 INFO L158 Benchmark]: CDTParser took 0.27ms. 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:39:18,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.43ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 96.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:39:18,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.87ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:39:18,179 INFO L158 Benchmark]: Boogie Preprocessor took 43.99ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:39:18,179 INFO L158 Benchmark]: IcfgBuilder took 737.55ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.9MB in the end (delta: 3.3MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2025-02-08 08:39:18,179 INFO L158 Benchmark]: TraceAbstraction took 28758.18ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 88.2MB in the beginning and 375.8MB in the end (delta: -287.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-02-08 08:39:18,180 INFO L158 Benchmark]: Witness Printer took 115.02ms. Allocated memory is still 494.9MB. Free memory was 375.8MB in the beginning and 367.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:39:18,180 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.43ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 96.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.87ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.99ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 737.55ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.9MB in the end (delta: 3.3MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28758.18ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 88.2MB in the beginning and 375.8MB in the end (delta: -287.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 115.02ms. Allocated memory is still 494.9MB. Free memory was 375.8MB in the beginning and 367.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 74]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 79 locations, 27 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: 28.7s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1808 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1468 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5591 IncrementalHoareTripleChecker+Invalid, 5809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 30 mSDtfsCounter, 5591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=572occurred in iteration=16, InterpolantAutomatonStates: 103, 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.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 346 ConstructedInterpolants, 53 QuantifiedInterpolants, 6217 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1216 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 108/146 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:39:18,203 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