./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:40:14,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:40:14,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:40:14,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:40:14,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:40:14,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:40:14,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:40:14,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:40:14,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:40:14,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:40:14,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:40:14,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:40:14,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:40:14,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:40:14,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:14,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:40:14,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:40:14,743 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-02-08 08:40:14,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:40:14,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:40:14,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:40:14,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:40:14,936 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:40:14,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-08 08:40:16,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b2d8f18/29afee8dd22f45f0bb8d4d74b4d77136/FLAG054332a03 [2025-02-08 08:40:16,320 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:40:16,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-08 08:40:16,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b2d8f18/29afee8dd22f45f0bb8d4d74b4d77136/FLAG054332a03 [2025-02-08 08:40:16,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b2d8f18/29afee8dd22f45f0bb8d4d74b4d77136 [2025-02-08 08:40:16,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:40:16,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:40:16,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:16,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:40:16,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:40:16,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f4b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16, skipping insertion in model container [2025-02-08 08:40:16,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:40:16,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:40:16,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:16,509 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:40:16,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:16,534 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:40:16,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16 WrapperNode [2025-02-08 08:40:16,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:16,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:16,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:40:16,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:40:16,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,563 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 251 [2025-02-08 08:40:16,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:16,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:40:16,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:40:16,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:40:16,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,583 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 08:40:16,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,589 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:40:16,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:40:16,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:40:16,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:40:16,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (1/1) ... [2025-02-08 08:40:16,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:16,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:40:16,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:40:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:40:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:40:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:40:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:40:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:40:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:40:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:40:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:40:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:40:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:40:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:40:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:40:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:40:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:40:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:40:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:40:16,642 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:40:16,707 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:40:16,708 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:40:16,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~ret4#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~ret3#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: havoc #t~mem2#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: havoc #t~mem1#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: ~res1~0 := #t~ret4#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-8: #t~ret4#1 := plus_#res#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: havoc plus_#res#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res1~0, #t~ret3#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-15: #t~ret3#1 := plus_#res#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:40:16,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~post5#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: ~i~0#1 := 1 + #t~post5#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: 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:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: #t~post5#1 := ~i~0#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-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:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:16,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 08:40:16,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:16,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 08:40:16,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~ret9#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: havoc #t~ret8#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: havoc #t~mem7#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: havoc #t~mem6#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: ~tmp~0#1 := #t~ret9#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: #t~ret9#1 := plus_#res#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:40:16,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: havoc plus_#res#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret8#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-15: #t~ret8#1 := plus_#res#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57: [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: ~res2~0 := ~tmp~0#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:40:16,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: havoc #t~post10#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: ~i~1#1 := 1 + #t~post10#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: #t~post10#1 := ~i~1#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc ~tmp~0#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: 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:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-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:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:16,924 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 08:40:16,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:16,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 08:40:16,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: havoc #t~post15#1; [2025-02-08 08:40:16,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: ~i~2#1 := 1 + #t~post15#1; [2025-02-08 08:40:16,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: #t~post15#1 := ~i~2#1; [2025-02-08 08:40:16,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: havoc ~tmp~1#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~ret14#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~ret13#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: havoc #t~mem12#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: havoc #t~mem11#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: ~tmp~1#1 := #t~ret14#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: #t~ret14#1 := plus_#res#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: havoc plus_#res#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret13#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:16,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-15: #t~ret13#1 := plus_#res#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: ~res2~0 := ~tmp~1#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: 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:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-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:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:40:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 08:40:17,099 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:40:17,099 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:40:17,306 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:40:17,306 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:40:17,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:17 BoogieIcfgContainer [2025-02-08 08:40:17,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:40:17,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:40:17,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:40:17,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:40:17,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:40:16" (1/3) ... [2025-02-08 08:40:17,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7d2084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:17, skipping insertion in model container [2025-02-08 08:40:17,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:16" (2/3) ... [2025-02-08 08:40:17,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7d2084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:17, skipping insertion in model container [2025-02-08 08:40:17,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:17" (3/3) ... [2025-02-08 08:40:17,313 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-02-08 08:40:17,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:40:17,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 5 loop locations, and 18 error locations. [2025-02-08 08:40:17,325 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:40:17,389 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:40:17,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 131 flow [2025-02-08 08:40:17,438 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2025-02-08 08:40:17,440 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:40:17,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 2/52 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 146 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-02-08 08:40:17,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 131 flow [2025-02-08 08:40:17,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 120 flow [2025-02-08 08:40:17,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:40:17,453 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;@4a122ee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:40:17,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-08 08:40:17,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:40:17,456 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:40:17,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:40:17,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:17,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:17,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 663801, now seen corresponding path program 1 times [2025-02-08 08:40:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:17,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210513982] [2025-02-08 08:40:17,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:17,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:17,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210513982] [2025-02-08 08:40:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210513982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:40:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757179935] [2025-02-08 08:40:17,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:17,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:17,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:17,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:17,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:17,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-02-08 08:40:17,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:17,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:17,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-02-08 08:40:17,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:17,799 INFO L124 PetriNetUnfolderBase]: 308/632 cut-off events. [2025-02-08 08:40:17,799 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 08:40:17,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 632 events. 308/632 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3565 event pairs, 306 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 1058. Up to 498 conditions per place. [2025-02-08 08:40:17,805 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 24 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-02-08 08:40:17,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 164 flow [2025-02-08 08:40:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-02-08 08:40:17,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-02-08 08:40:17,813 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 120 flow. Second operand 3 states and 104 transitions. [2025-02-08 08:40:17,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 164 flow [2025-02-08 08:40:17,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 152 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:17,821 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 104 flow [2025-02-08 08:40:17,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-02-08 08:40:17,824 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2025-02-08 08:40:17,824 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 104 flow [2025-02-08 08:40:17,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:17,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:17,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:17,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:40:17,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 663802, now seen corresponding path program 1 times [2025-02-08 08:40:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:17,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901872373] [2025-02-08 08:40:17,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:17,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:17,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:17,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:17,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:18,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901872373] [2025-02-08 08:40:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901872373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744922456] [2025-02-08 08:40:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:18,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:18,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:18,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:18,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-02-08 08:40:18,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:18,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:18,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-02-08 08:40:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:18,300 INFO L124 PetriNetUnfolderBase]: 309/635 cut-off events. [2025-02-08 08:40:18,300 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:40:18,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 635 events. 309/635 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3572 event pairs, 306 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 1140. Up to 507 conditions per place. [2025-02-08 08:40:18,303 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-02-08 08:40:18,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 172 flow [2025-02-08 08:40:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-02-08 08:40:18,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 08:40:18,304 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 104 flow. Second operand 4 states and 132 transitions. [2025-02-08 08:40:18,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 172 flow [2025-02-08 08:40:18,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:18,306 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 127 flow [2025-02-08 08:40:18,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2025-02-08 08:40:18,307 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2025-02-08 08:40:18,307 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 127 flow [2025-02-08 08:40:18,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:18,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:18,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:40:18,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:40:18,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:18,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:18,308 INFO L85 PathProgramCache]: Analyzing trace with hash 20579888, now seen corresponding path program 1 times [2025-02-08 08:40:18,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:18,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360847311] [2025-02-08 08:40:18,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:18,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:18,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:40:18,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:40:18,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:18,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:18,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:18,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360847311] [2025-02-08 08:40:18,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360847311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:18,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:18,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:18,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130864078] [2025-02-08 08:40:18,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:18,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:18,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:18,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:18,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-02-08 08:40:18,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:18,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:18,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-02-08 08:40:18,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:18,564 INFO L124 PetriNetUnfolderBase]: 308/638 cut-off events. [2025-02-08 08:40:18,564 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:40:18,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 638 events. 308/638 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3558 event pairs, 306 based on Foata normal form. 1/544 useless extension candidates. Maximal degree in co-relation 1163. Up to 504 conditions per place. [2025-02-08 08:40:18,568 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 26 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2025-02-08 08:40:18,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 193 flow [2025-02-08 08:40:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-02-08 08:40:18,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2025-02-08 08:40:18,569 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 127 flow. Second operand 4 states and 142 transitions. [2025-02-08 08:40:18,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 193 flow [2025-02-08 08:40:18,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:18,570 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 142 flow [2025-02-08 08:40:18,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-02-08 08:40:18,571 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-02-08 08:40:18,571 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 142 flow [2025-02-08 08:40:18,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:18,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:18,571 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:40:18,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:40:18,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash 637934615, now seen corresponding path program 1 times [2025-02-08 08:40:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656387557] [2025-02-08 08:40:18,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:18,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:18,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:18,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656387557] [2025-02-08 08:40:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656387557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077978149] [2025-02-08 08:40:18,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:18,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:18,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:18,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:40:18,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:18,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:18,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:18,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:18,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:18,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:18,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-08 08:40:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:19,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077978149] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:19,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:40:19,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651324367] [2025-02-08 08:40:19,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:19,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:19,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:19,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:19,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:19,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-02-08 08:40:19,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 142 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:19,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:19,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-02-08 08:40:19,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:19,734 INFO L124 PetriNetUnfolderBase]: 308/636 cut-off events. [2025-02-08 08:40:19,734 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:40:19,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 636 events. 308/636 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3566 event pairs, 306 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 1168. Up to 505 conditions per place. [2025-02-08 08:40:19,739 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 24 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2025-02-08 08:40:19,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 198 flow [2025-02-08 08:40:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-02-08 08:40:19,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-02-08 08:40:19,742 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 142 flow. Second operand 6 states and 180 transitions. [2025-02-08 08:40:19,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 198 flow [2025-02-08 08:40:19,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 190 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:19,745 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 142 flow [2025-02-08 08:40:19,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-02-08 08:40:19,746 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-02-08 08:40:19,746 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 142 flow [2025-02-08 08:40:19,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:19,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:19,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:40:19,756 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:40:19,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:19,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1698861389, now seen corresponding path program 1 times [2025-02-08 08:40:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:19,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794618522] [2025-02-08 08:40:19,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:19,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:19,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:19,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:19,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,166 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:40:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794618522] [2025-02-08 08:40:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794618522] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833869990] [2025-02-08 08:40:20,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:20,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:20,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:20,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:40:20,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:20,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:20,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:20,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:40:20,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:20,239 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:40:20,316 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:40:20,316 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:40:20,331 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:40:20,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:20,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833869990] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:20,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:40:20,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-02-08 08:40:20,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810994089] [2025-02-08 08:40:20,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:20,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:20,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:20,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:20,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:40:20,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-02-08 08:40:20,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:20,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:20,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-02-08 08:40:20,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:20,516 INFO L124 PetriNetUnfolderBase]: 308/635 cut-off events. [2025-02-08 08:40:20,516 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:40:20,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 635 events. 308/635 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3566 event pairs, 306 based on Foata normal form. 1/543 useless extension candidates. Maximal degree in co-relation 1164. Up to 504 conditions per place. [2025-02-08 08:40:20,519 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-02-08 08:40:20,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 206 flow [2025-02-08 08:40:20,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-02-08 08:40:20,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709090909090909 [2025-02-08 08:40:20,521 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 142 flow. Second operand 5 states and 157 transitions. [2025-02-08 08:40:20,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 206 flow [2025-02-08 08:40:20,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 180 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 08:40:20,522 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 128 flow [2025-02-08 08:40:20,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-02-08 08:40:20,523 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-02-08 08:40:20,523 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 128 flow [2025-02-08 08:40:20,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:20,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:20,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:20,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:20,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:20,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:20,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash -518201134, now seen corresponding path program 1 times [2025-02-08 08:40:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129503251] [2025-02-08 08:40:20,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:20,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:20,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:20,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:20,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,795 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:40:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:20,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129503251] [2025-02-08 08:40:20,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129503251] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:20,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509916967] [2025-02-08 08:40:20,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:20,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:20,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:40:20,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:20,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:20,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:40:20,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:20,893 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:40:20,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:20,929 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:40:20,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509916967] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:20,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 08:40:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442978014] [2025-02-08 08:40:20,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:20,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:40:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:20,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:40:20,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:40:20,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-02-08 08:40:20,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 128 flow. Second operand has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:20,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:20,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-02-08 08:40:20,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:21,160 INFO L124 PetriNetUnfolderBase]: 615/1268 cut-off events. [2025-02-08 08:40:21,160 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 08:40:21,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 1268 events. 615/1268 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8218 event pairs, 612 based on Foata normal form. 1/1092 useless extension candidates. Maximal degree in co-relation 1160. Up to 502 conditions per place. [2025-02-08 08:40:21,165 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 44 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2025-02-08 08:40:21,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 324 flow [2025-02-08 08:40:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:40:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:40:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2025-02-08 08:40:21,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-08 08:40:21,166 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 128 flow. Second operand 8 states and 275 transitions. [2025-02-08 08:40:21,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 324 flow [2025-02-08 08:40:21,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 310 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:40:21,167 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 192 flow [2025-02-08 08:40:21,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-02-08 08:40:21,168 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2025-02-08 08:40:21,168 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 192 flow [2025-02-08 08:40:21,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:21,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:21,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-08 08:40:21,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:21,373 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:40:21,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:21,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1042133035, now seen corresponding path program 2 times [2025-02-08 08:40:21,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:21,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428547731] [2025-02-08 08:40:21,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:21,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:40:21,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:21,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:21,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:21,565 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:40:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428547731] [2025-02-08 08:40:21,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428547731] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243030105] [2025-02-08 08:40:21,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:21,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:21,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:21,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:40:21,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:40:21,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:21,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:21,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:21,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 08:40:21,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:21,641 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:40:21,725 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:40:21,726 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:40:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:21,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:21,959 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:40:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243030105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:21,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2025-02-08 08:40:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211225398] [2025-02-08 08:40:21,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:21,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:40:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:21,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:40:21,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:40:22,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-02-08 08:40:22,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 192 flow. Second operand has 18 states, 18 states have (on average 26.555555555555557) internal successors, (478), 18 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:22,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:22,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-02-08 08:40:22,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:23,382 INFO L124 PetriNetUnfolderBase]: 929/1918 cut-off events. [2025-02-08 08:40:23,382 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 08:40:23,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 1918 events. 929/1918 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12158 event pairs, 918 based on Foata normal form. 8/1656 useless extension candidates. Maximal degree in co-relation 1208. Up to 999 conditions per place. [2025-02-08 08:40:23,389 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 40 selfloop transitions, 46 changer transitions 0/105 dead transitions. [2025-02-08 08:40:23,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 105 transitions, 586 flow [2025-02-08 08:40:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 08:40:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 08:40:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 590 transitions. [2025-02-08 08:40:23,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2025-02-08 08:40:23,392 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 192 flow. Second operand 20 states and 590 transitions. [2025-02-08 08:40:23,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 105 transitions, 586 flow [2025-02-08 08:40:23,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 105 transitions, 536 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:23,398 INFO L231 Difference]: Finished difference. Result has 80 places, 85 transitions, 426 flow [2025-02-08 08:40:23,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=426, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2025-02-08 08:40:23,398 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 21 predicate places. [2025-02-08 08:40:23,398 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 426 flow [2025-02-08 08:40:23,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 26.555555555555557) internal successors, (478), 18 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:23,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:23,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:23,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:40:23,603 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,SelfDestructingSolverStorable6 [2025-02-08 08:40:23,603 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:23,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1614369269, now seen corresponding path program 1 times [2025-02-08 08:40:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:23,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611052268] [2025-02-08 08:40:23,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:23,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:23,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611052268] [2025-02-08 08:40:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611052268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157551977] [2025-02-08 08:40:23,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:23,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:23,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:23,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2025-02-08 08:40:23,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 426 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:40:23,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:23,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2025-02-08 08:40:23,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:24,073 INFO L124 PetriNetUnfolderBase]: 1835/3202 cut-off events. [2025-02-08 08:40:24,074 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 08:40:24,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6337 conditions, 3202 events. 1835/3202 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 18178 event pairs, 1824 based on Foata normal form. 0/3027 useless extension candidates. Maximal degree in co-relation 2112. Up to 2858 conditions per place. [2025-02-08 08:40:24,089 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 54 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-02-08 08:40:24,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 558 flow [2025-02-08 08:40:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-02-08 08:40:24,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4618181818181818 [2025-02-08 08:40:24,090 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 426 flow. Second operand 5 states and 127 transitions. [2025-02-08 08:40:24,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 558 flow [2025-02-08 08:40:24,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 508 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:24,093 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 400 flow [2025-02-08 08:40:24,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=400, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-02-08 08:40:24,095 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2025-02-08 08:40:24,096 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 400 flow [2025-02-08 08:40:24,096 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:40:24,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:24,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:24,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:40:24,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:24,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1614369268, now seen corresponding path program 1 times [2025-02-08 08:40:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297721134] [2025-02-08 08:40:24,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:24,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:24,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:24,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:24,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297721134] [2025-02-08 08:40:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297721134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419947882] [2025-02-08 08:40:24,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:24,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:24,228 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:40:24,229 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:40:24,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:24,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:24,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:24,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:24,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 08:40:24,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:24,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:40:24,305 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:40:24,394 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:40:24,395 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 31 treesize of output 28 [2025-02-08 08:40:24,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:40:24,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:40:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:24,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419947882] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:24,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:40:24,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2025-02-08 08:40:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171282321] [2025-02-08 08:40:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:24,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:40:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:24,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:40:24,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:40:24,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-02-08 08:40:24,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:24,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:24,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-02-08 08:40:24,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:25,244 INFO L124 PetriNetUnfolderBase]: 1169/2434 cut-off events. [2025-02-08 08:40:25,244 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 08:40:25,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4548 conditions, 2434 events. 1169/2434 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16479 event pairs, 438 based on Foata normal form. 0/2185 useless extension candidates. Maximal degree in co-relation 1514. Up to 1098 conditions per place. [2025-02-08 08:40:25,253 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 59 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2025-02-08 08:40:25,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 590 flow [2025-02-08 08:40:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:40:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:40:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2025-02-08 08:40:25,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.561038961038961 [2025-02-08 08:40:25,255 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 400 flow. Second operand 7 states and 216 transitions. [2025-02-08 08:40:25,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 590 flow [2025-02-08 08:40:25,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 93 transitions, 564 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 08:40:25,258 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 414 flow [2025-02-08 08:40:25,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=414, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2025-02-08 08:40:25,259 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2025-02-08 08:40:25,259 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 414 flow [2025-02-08 08:40:25,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:25,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:25,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:25,269 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:40:25,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:25,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:25,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:25,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1494160842, now seen corresponding path program 1 times [2025-02-08 08:40:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975156725] [2025-02-08 08:40:25,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:25,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:25,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:25,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:25,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975156725] [2025-02-08 08:40:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975156725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093747517] [2025-02-08 08:40:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:25,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:25,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:25,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:25,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2025-02-08 08:40:25,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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:40:25,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:25,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2025-02-08 08:40:25,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:25,673 INFO L124 PetriNetUnfolderBase]: 929/1798 cut-off events. [2025-02-08 08:40:25,674 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-02-08 08:40:25,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3792 conditions, 1798 events. 929/1798 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10596 event pairs, 918 based on Foata normal form. 0/1645 useless extension candidates. Maximal degree in co-relation 1335. Up to 1496 conditions per place. [2025-02-08 08:40:25,683 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 57 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2025-02-08 08:40:25,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 540 flow [2025-02-08 08:40:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-08 08:40:25,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-02-08 08:40:25,684 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 414 flow. Second operand 4 states and 117 transitions. [2025-02-08 08:40:25,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 540 flow [2025-02-08 08:40:25,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 511 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:25,686 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 397 flow [2025-02-08 08:40:25,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2025-02-08 08:40:25,687 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2025-02-08 08:40:25,688 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 397 flow [2025-02-08 08:40:25,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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:40:25,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:25,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:25,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:40:25,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:25,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1494160843, now seen corresponding path program 1 times [2025-02-08 08:40:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415142965] [2025-02-08 08:40:25,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:25,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:25,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:25,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:25,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415142965] [2025-02-08 08:40:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415142965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203823895] [2025-02-08 08:40:25,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:25,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:25,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:25,798 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:40:25,801 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:40:25,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:25,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:25,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:25,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:25,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:25,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:25,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:25,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 08:40:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203823895] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:26,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 08:40:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891053398] [2025-02-08 08:40:26,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:26,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:26,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:26,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:26,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:26,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-02-08 08:40:26,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 397 flow. Second operand has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:26,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:26,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-02-08 08:40:26,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:26,393 INFO L124 PetriNetUnfolderBase]: 929/1912 cut-off events. [2025-02-08 08:40:26,393 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-08 08:40:26,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3648 conditions, 1912 events. 929/1912 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12028 event pairs, 438 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 1283. Up to 764 conditions per place. [2025-02-08 08:40:26,401 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 57 selfloop transitions, 21 changer transitions 0/89 dead transitions. [2025-02-08 08:40:26,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 583 flow [2025-02-08 08:40:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2025-02-08 08:40:26,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 08:40:26,402 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 397 flow. Second operand 6 states and 198 transitions. [2025-02-08 08:40:26,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 583 flow [2025-02-08 08:40:26,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:26,404 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 427 flow [2025-02-08 08:40:26,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=427, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-02-08 08:40:26,408 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2025-02-08 08:40:26,408 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 427 flow [2025-02-08 08:40:26,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:26,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:26,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:26,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:26,608 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,SelfDestructingSolverStorable10 [2025-02-08 08:40:26,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:26,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash -931307886, now seen corresponding path program 1 times [2025-02-08 08:40:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815760394] [2025-02-08 08:40:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:26,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:40:26,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:40:26,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:26,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:26,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815760394] [2025-02-08 08:40:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815760394] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330178105] [2025-02-08 08:40:26,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:26,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:26,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:26,690 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:40:26,691 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:40:26,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:40:26,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:40:26,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:26,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:26,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:40:26,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:26,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330178105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:26,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:26,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 08:40:26,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301524687] [2025-02-08 08:40:26,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:26,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:40:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:26,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:40:26,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:40:26,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-02-08 08:40:26,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 427 flow. Second operand has 14 states, 14 states have (on average 28.0) internal successors, (392), 14 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:26,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:26,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-02-08 08:40:26,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:27,206 INFO L124 PetriNetUnfolderBase]: 1014/1915 cut-off events. [2025-02-08 08:40:27,207 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-02-08 08:40:27,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 1915 events. 1014/1915 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10936 event pairs, 908 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 1642. Up to 1269 conditions per place. [2025-02-08 08:40:27,211 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 57 selfloop transitions, 38 changer transitions 2/107 dead transitions. [2025-02-08 08:40:27,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 107 transitions, 706 flow [2025-02-08 08:40:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:40:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:40:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 303 transitions. [2025-02-08 08:40:27,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2025-02-08 08:40:27,213 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 427 flow. Second operand 9 states and 303 transitions. [2025-02-08 08:40:27,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 107 transitions, 706 flow [2025-02-08 08:40:27,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 107 transitions, 656 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:27,215 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 477 flow [2025-02-08 08:40:27,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=477, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-02-08 08:40:27,215 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2025-02-08 08:40:27,215 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 477 flow [2025-02-08 08:40:27,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.0) internal successors, (392), 14 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:27,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:27,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:27,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:27,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:27,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:27,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1654241075, now seen corresponding path program 1 times [2025-02-08 08:40:27,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:27,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964177246] [2025-02-08 08:40:27,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:27,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:27,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:40:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:27,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964177246] [2025-02-08 08:40:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964177246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:40:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926114302] [2025-02-08 08:40:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:40:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:40:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:40:27,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-02-08 08:40:27,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 477 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:27,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:27,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-02-08 08:40:27,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:28,031 INFO L124 PetriNetUnfolderBase]: 1040/2111 cut-off events. [2025-02-08 08:40:28,031 INFO L125 PetriNetUnfolderBase]: For 546/588 co-relation queries the response was YES. [2025-02-08 08:40:28,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 2111 events. 1040/2111 cut-off events. For 546/588 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13141 event pairs, 441 based on Foata normal form. 0/2050 useless extension candidates. Maximal degree in co-relation 1852. Up to 894 conditions per place. [2025-02-08 08:40:28,038 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 63 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2025-02-08 08:40:28,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 89 transitions, 671 flow [2025-02-08 08:40:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-02-08 08:40:28,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-02-08 08:40:28,040 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 477 flow. Second operand 6 states and 175 transitions. [2025-02-08 08:40:28,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 89 transitions, 671 flow [2025-02-08 08:40:28,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 601 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:28,044 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 439 flow [2025-02-08 08:40:28,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2025-02-08 08:40:28,045 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2025-02-08 08:40:28,046 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 439 flow [2025-02-08 08:40:28,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:28,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:28,046 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:40:28,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:40:28,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:28,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:28,047 INFO L85 PathProgramCache]: Analyzing trace with hash 258134844, now seen corresponding path program 1 times [2025-02-08 08:40:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118202926] [2025-02-08 08:40:28,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:28,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:40:28,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:40:28,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:28,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:28,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118202926] [2025-02-08 08:40:28,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118202926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709544527] [2025-02-08 08:40:28,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:28,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:28,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:28,243 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:40:28,244 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:40:28,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:40:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:40:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:28,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:40:28,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:28,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:28,521 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 36 treesize of output 32 [2025-02-08 08:40:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709544527] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:28,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:28,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-08 08:40:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842171793] [2025-02-08 08:40:28,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:28,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:40:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:28,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:40:28,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:40:29,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-02-08 08:40:29,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 439 flow. Second operand has 20 states, 20 states have (on average 28.1) internal successors, (562), 20 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:29,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:29,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-02-08 08:40:29,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:29,699 INFO L124 PetriNetUnfolderBase]: 1260/2261 cut-off events. [2025-02-08 08:40:29,699 INFO L125 PetriNetUnfolderBase]: For 940/1030 co-relation queries the response was YES. [2025-02-08 08:40:29,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5432 conditions, 2261 events. 1260/2261 cut-off events. For 940/1030 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13108 event pairs, 898 based on Foata normal form. 0/2086 useless extension candidates. Maximal degree in co-relation 2826. Up to 1006 conditions per place. [2025-02-08 08:40:29,705 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 83 selfloop transitions, 40 changer transitions 16/148 dead transitions. [2025-02-08 08:40:29,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 148 transitions, 930 flow [2025-02-08 08:40:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 08:40:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 08:40:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 579 transitions. [2025-02-08 08:40:29,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5848484848484848 [2025-02-08 08:40:29,707 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 439 flow. Second operand 18 states and 579 transitions. [2025-02-08 08:40:29,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 148 transitions, 930 flow [2025-02-08 08:40:29,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 148 transitions, 888 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:29,711 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 508 flow [2025-02-08 08:40:29,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=508, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2025-02-08 08:40:29,711 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 37 predicate places. [2025-02-08 08:40:29,711 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 508 flow [2025-02-08 08:40:29,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 28.1) internal successors, (562), 20 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:29,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:29,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:29,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:40:29,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:29,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:29,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash -986623184, now seen corresponding path program 2 times [2025-02-08 08:40:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:29,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785307979] [2025-02-08 08:40:29,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:29,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:40:29,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:29,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:29,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785307979] [2025-02-08 08:40:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785307979] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162715060] [2025-02-08 08:40:30,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:30,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:30,175 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:30,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:40:30,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:40:30,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:30,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:30,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:30,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:40:30,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:30,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:40:30,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:40:30,303 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:40:30,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:40:30,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:40:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:30,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:30,472 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:40:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162715060] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:30,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2025-02-08 08:40:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683238547] [2025-02-08 08:40:30,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:30,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:40:30,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:30,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:40:30,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:40:31,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2025-02-08 08:40:31,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 508 flow. Second operand has 20 states, 20 states have (on average 24.35) internal successors, (487), 20 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:31,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:31,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2025-02-08 08:40:31,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:32,383 INFO L124 PetriNetUnfolderBase]: 1300/2309 cut-off events. [2025-02-08 08:40:32,383 INFO L125 PetriNetUnfolderBase]: For 800/852 co-relation queries the response was YES. [2025-02-08 08:40:32,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5779 conditions, 2309 events. 1300/2309 cut-off events. For 800/852 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13088 event pairs, 514 based on Foata normal form. 0/2199 useless extension candidates. Maximal degree in co-relation 4106. Up to 1132 conditions per place. [2025-02-08 08:40:32,392 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 78 selfloop transitions, 28 changer transitions 2/115 dead transitions. [2025-02-08 08:40:32,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 115 transitions, 829 flow [2025-02-08 08:40:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:40:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 08:40:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 386 transitions. [2025-02-08 08:40:32,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5012987012987012 [2025-02-08 08:40:32,394 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 508 flow. Second operand 14 states and 386 transitions. [2025-02-08 08:40:32,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 115 transitions, 829 flow [2025-02-08 08:40:32,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 115 transitions, 777 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 08:40:32,398 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 522 flow [2025-02-08 08:40:32,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=522, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2025-02-08 08:40:32,398 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 41 predicate places. [2025-02-08 08:40:32,398 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 522 flow [2025-02-08 08:40:32,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 24.35) internal successors, (487), 20 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:32,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:32,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:32,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:32,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:32,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -520547024, now seen corresponding path program 1 times [2025-02-08 08:40:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931521617] [2025-02-08 08:40:32,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:32,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:40:32,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:40:32,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:32,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:40:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931521617] [2025-02-08 08:40:32,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931521617] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:32,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747254810] [2025-02-08 08:40:32,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:32,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:32,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:32,762 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:32,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:40:32,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:40:32,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:40:32,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:32,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:32,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:40:32,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:40:32,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:32,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 08:40:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:40:32,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747254810] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:32,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-02-08 08:40:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77179508] [2025-02-08 08:40:32,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:32,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:40:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:32,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:40:32,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:40:33,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-02-08 08:40:33,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 522 flow. Second operand has 18 states, 18 states have (on average 28.166666666666668) internal successors, (507), 18 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:33,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:33,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-02-08 08:40:33,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:33,941 INFO L124 PetriNetUnfolderBase]: 960/1855 cut-off events. [2025-02-08 08:40:33,942 INFO L125 PetriNetUnfolderBase]: For 1079/1121 co-relation queries the response was YES. [2025-02-08 08:40:33,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 1855 events. 960/1855 cut-off events. For 1079/1121 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10726 event pairs, 478 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 3463. Up to 670 conditions per place. [2025-02-08 08:40:33,949 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 73 selfloop transitions, 29 changer transitions 4/114 dead transitions. [2025-02-08 08:40:33,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 114 transitions, 827 flow [2025-02-08 08:40:33,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:40:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 08:40:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 414 transitions. [2025-02-08 08:40:33,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.579020979020979 [2025-02-08 08:40:33,952 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 522 flow. Second operand 13 states and 414 transitions. [2025-02-08 08:40:33,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 114 transitions, 827 flow [2025-02-08 08:40:33,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 114 transitions, 788 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 08:40:33,957 INFO L231 Difference]: Finished difference. Result has 102 places, 80 transitions, 535 flow [2025-02-08 08:40:33,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=535, PETRI_PLACES=102, PETRI_TRANSITIONS=80} [2025-02-08 08:40:33,958 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 43 predicate places. [2025-02-08 08:40:33,958 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 80 transitions, 535 flow [2025-02-08 08:40:33,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 28.166666666666668) internal successors, (507), 18 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:33,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:33,958 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:33,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:40:34,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 08:40:34,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:34,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash 449533570, now seen corresponding path program 2 times [2025-02-08 08:40:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:34,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741416123] [2025-02-08 08:40:34,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:34,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 08:40:34,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:40:34,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:34,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741416123] [2025-02-08 08:40:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741416123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948600719] [2025-02-08 08:40:34,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:34,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:34,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:34,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:40:34,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 08:40:34,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:40:34,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:34,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:34,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:40:34,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:40:34,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:40:34,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948600719] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:34,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:34,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-02-08 08:40:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21651036] [2025-02-08 08:40:34,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:34,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:40:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:34,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:40:34,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:40:34,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-02-08 08:40:34,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 80 transitions, 535 flow. Second operand has 16 states, 16 states have (on average 29.1875) internal successors, (467), 16 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:34,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:34,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-02-08 08:40:34,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:34,945 INFO L124 PetriNetUnfolderBase]: 880/1725 cut-off events. [2025-02-08 08:40:34,945 INFO L125 PetriNetUnfolderBase]: For 1985/2065 co-relation queries the response was YES. [2025-02-08 08:40:34,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4795 conditions, 1725 events. 880/1725 cut-off events. For 1985/2065 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9912 event pairs, 871 based on Foata normal form. 2/1702 useless extension candidates. Maximal degree in co-relation 3140. Up to 779 conditions per place. [2025-02-08 08:40:34,952 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 44 changer transitions 1/110 dead transitions. [2025-02-08 08:40:34,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 809 flow [2025-02-08 08:40:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:40:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 08:40:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 488 transitions. [2025-02-08 08:40:34,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5915151515151515 [2025-02-08 08:40:34,954 INFO L175 Difference]: Start difference. First operand has 102 places, 80 transitions, 535 flow. Second operand 15 states and 488 transitions. [2025-02-08 08:40:34,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 809 flow [2025-02-08 08:40:34,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 110 transitions, 737 flow, removed 2 selfloop flow, removed 14 redundant places. [2025-02-08 08:40:34,961 INFO L231 Difference]: Finished difference. Result has 99 places, 78 transitions, 529 flow [2025-02-08 08:40:34,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=529, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2025-02-08 08:40:34,961 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places. [2025-02-08 08:40:34,961 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 78 transitions, 529 flow [2025-02-08 08:40:34,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 29.1875) internal successors, (467), 16 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:34,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:34,962 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:34,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 08:40:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 08:40:35,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1627533790, now seen corresponding path program 3 times [2025-02-08 08:40:35,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851909184] [2025-02-08 08:40:35,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:40:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:35,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-02-08 08:40:35,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 20 statements. [2025-02-08 08:40:35,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:40:35,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:40:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851909184] [2025-02-08 08:40:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851909184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430430272] [2025-02-08 08:40:35,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:40:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:35,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:35,293 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:35,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 08:40:35,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-02-08 08:40:35,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 20 statements. [2025-02-08 08:40:35,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:40:35,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:40:35,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:40:35,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430430272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-02-08 08:40:35,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162728768] [2025-02-08 08:40:35,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:35,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:40:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:35,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:40:35,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:40:35,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-02-08 08:40:35,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 78 transitions, 529 flow. Second operand has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:35,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:35,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-02-08 08:40:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:35,817 INFO L124 PetriNetUnfolderBase]: 1148/2151 cut-off events. [2025-02-08 08:40:35,818 INFO L125 PetriNetUnfolderBase]: For 887/968 co-relation queries the response was YES. [2025-02-08 08:40:35,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5239 conditions, 2151 events. 1148/2151 cut-off events. For 887/968 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12621 event pairs, 603 based on Foata normal form. 111/2223 useless extension candidates. Maximal degree in co-relation 3661. Up to 1048 conditions per place. [2025-02-08 08:40:35,824 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 65 selfloop transitions, 12 changer transitions 6/88 dead transitions. [2025-02-08 08:40:35,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 725 flow [2025-02-08 08:40:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-02-08 08:40:35,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5854545454545454 [2025-02-08 08:40:35,825 INFO L175 Difference]: Start difference. First operand has 99 places, 78 transitions, 529 flow. Second operand 5 states and 161 transitions. [2025-02-08 08:40:35,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 725 flow [2025-02-08 08:40:35,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 674 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 08:40:35,829 INFO L231 Difference]: Finished difference. Result has 93 places, 73 transitions, 490 flow [2025-02-08 08:40:35,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=490, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2025-02-08 08:40:35,830 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2025-02-08 08:40:35,830 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 490 flow [2025-02-08 08:40:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:35,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:35,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:35,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:36,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:40:36,031 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-02-08 08:40:36,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash 849617366, now seen corresponding path program 1 times [2025-02-08 08:40:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058882566] [2025-02-08 08:40:36,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:36,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:40:36,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:40:36,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:36,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:40:36,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:36,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058882566] [2025-02-08 08:40:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058882566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:36,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114925347] [2025-02-08 08:40:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:36,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:36,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:36,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:36,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-02-08 08:40:36,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:36,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:36,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-02-08 08:40:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:36,119 INFO L124 PetriNetUnfolderBase]: 505/989 cut-off events. [2025-02-08 08:40:36,120 INFO L125 PetriNetUnfolderBase]: For 664/706 co-relation queries the response was YES. [2025-02-08 08:40:36,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 989 events. 505/989 cut-off events. For 664/706 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4277 event pairs, 496 based on Foata normal form. 4/992 useless extension candidates. Maximal degree in co-relation 1882. Up to 909 conditions per place. [2025-02-08 08:40:36,122 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 0 selfloop transitions, 0 changer transitions 71/71 dead transitions. [2025-02-08 08:40:36,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 71 transitions, 620 flow [2025-02-08 08:40:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-02-08 08:40:36,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-02-08 08:40:36,123 INFO L175 Difference]: Start difference. First operand has 93 places, 73 transitions, 490 flow. Second operand 3 states and 104 transitions. [2025-02-08 08:40:36,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 71 transitions, 620 flow [2025-02-08 08:40:36,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 71 transitions, 596 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:40:36,126 INFO L231 Difference]: Finished difference. Result has 85 places, 0 transitions, 0 flow [2025-02-08 08:40:36,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=85, PETRI_TRANSITIONS=0} [2025-02-08 08:40:36,127 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2025-02-08 08:40:36,127 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 0 transitions, 0 flow [2025-02-08 08:40:36,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:36,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 33 remaining) [2025-02-08 08:40:36,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 33 remaining) [2025-02-08 08:40:36,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 33 remaining) [2025-02-08 08:40:36,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 33 remaining) [2025-02-08 08:40:36,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2025-02-08 08:40:36,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 33 remaining) [2025-02-08 08:40:36,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 33 remaining) [2025-02-08 08:40:36,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:40:36,132 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:36,135 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:40:36,135 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:40:36,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:40:36 BasicIcfg [2025-02-08 08:40:36,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:40:36,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:40:36,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:40:36,139 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:40:36,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:17" (3/4) ... [2025-02-08 08:40:36,141 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:40:36,143 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:40:36,143 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:40:36,143 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:40:36,148 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 96 nodes and edges [2025-02-08 08:40:36,148 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2025-02-08 08:40:36,149 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 08:40:36,149 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:40:36,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:40:36,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:40:36,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:40:36,222 INFO L158 Benchmark]: Toolchain (without parser) took 19870.23ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 114.1MB in the beginning and 222.5MB in the end (delta: -108.3MB). Peak memory consumption was 169.3MB. Max. memory is 16.1GB. [2025-02-08 08:40:36,222 INFO L158 Benchmark]: CDTParser took 0.13ms. 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:40:36,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.21ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 102.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:36,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.86ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 100.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:36,223 INFO L158 Benchmark]: Boogie Preprocessor took 29.09ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 97.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:36,224 INFO L158 Benchmark]: IcfgBuilder took 712.89ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 104.4MB in the end (delta: -7.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:36,224 INFO L158 Benchmark]: TraceAbstraction took 18830.34ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 103.7MB in the beginning and 226.8MB in the end (delta: -123.1MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2025-02-08 08:40:36,224 INFO L158 Benchmark]: Witness Printer took 82.08ms. Allocated memory is still 419.4MB. Free memory was 226.8MB in the beginning and 222.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:36,225 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.21ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 102.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.86ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 100.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.09ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 97.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 712.89ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 104.4MB in the end (delta: -7.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18830.34ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 103.7MB in the beginning and 226.8MB in the end (delta: -123.1MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. * Witness Printer took 82.08ms. Allocated memory is still 419.4MB. Free memory was 226.8MB in the beginning and 222.5MB in the end (delta: 4.3MB). 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: -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: 72]: 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, 87 locations, 33 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: 18.7s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3514 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3037 mSDsluCounter, 1960 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1892 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12856 IncrementalHoareTripleChecker+Invalid, 13097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 68 mSDtfsCounter, 12856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 182 SyntacticMatches, 5 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=535occurred in iteration=16, InterpolantAutomatonStates: 155, 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.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 384 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 478 ConstructedInterpolants, 16 QuantifiedInterpolants, 5250 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1749 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 293/405 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:40:36,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE