./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.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/loop-tiling-eq.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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:36:21,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:36:21,237 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:36:21,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:36:21,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:36:21,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:36:21,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:36:21,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:36:21,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:36:21,288 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:36:21,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:36:21,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:36:21,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:36:21,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:36:21,290 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:36:21,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:36:21,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:36:21,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:36:21,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:36:21,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:36:21,295 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:36:21,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:36:21,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:36:21,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:36:21,296 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-02-08 08:36:21,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:36:21,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:36:21,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:36:21,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:36:21,615 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:36:21,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-08 08:36:22,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24c9bb2ff/a5d92c788cd94da281a37282aa516175/FLAG90294fe86 [2025-02-08 08:36:23,085 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:36:23,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-08 08:36:23,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24c9bb2ff/a5d92c788cd94da281a37282aa516175/FLAG90294fe86 [2025-02-08 08:36:23,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24c9bb2ff/a5d92c788cd94da281a37282aa516175 [2025-02-08 08:36:23,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:36:23,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:36:23,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:36:23,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:36:23,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:36:23,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c600d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23, skipping insertion in model container [2025-02-08 08:36:23,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:36:23,590 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:36:23,603 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:36:23,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:36:23,611 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:36:23,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:36:23,647 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:36:23,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23 WrapperNode [2025-02-08 08:36:23,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:36:23,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:36:23,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:36:23,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:36:23,660 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:36:23" (1/1) ... [2025-02-08 08:36:23,673 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:36:23" (1/1) ... [2025-02-08 08:36:23,702 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 174 [2025-02-08 08:36:23,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:36:23,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:36:23,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:36:23,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:36:23,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,744 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 1, 5]. [2025-02-08 08:36:23,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:36:23,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:36:23,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:36:23,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:36:23,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (1/1) ... [2025-02-08 08:36:23,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:36:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:23,811 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:36:23,816 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:36:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:36:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:36:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:36:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:36:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:36:23,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:36:23,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:36:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:36:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:36:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:36:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:36:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:36:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:36:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:36:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:36:23,836 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:36:23,919 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:36:23,920 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:36:24,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-1: havoc main_#t~post13#1; [2025-02-08 08:36:24,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-2: main_~i~2#1 := 1 + main_#t~post13#1; [2025-02-08 08:36:24,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: main_#t~post13#1 := main_~i~2#1; [2025-02-08 08:36:24,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; [2025-02-08 08:36:24,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-1: SUMMARY for call write~$Pointer$#1(main_#t~ret12#1.base, main_#t~ret12#1.offset, ~B~0.base, ~B~0.offset + 4 * main_~i~2#1, 4); srcloc: null [2025-02-08 08:36:24,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-1: assume !(1 == #valid[~B~0.base]); [2025-02-08 08:36:24,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-1: assume !(4 + (~B~0.offset + 4 * main_~i~2#1) <= #length[~B~0.base] && 0 <= ~B~0.offset + 4 * main_~i~2#1); [2025-02-08 08:36:24,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-2: havoc create_fresh_int_array_#in~size#1;assume { :end_inline_create_fresh_int_array } true; [2025-02-08 08:36:24,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-3: havoc create_fresh_int_array_#t~malloc23#1.base, create_fresh_int_array_#t~malloc23#1.offset, create_fresh_int_array_#t~nondet24#1, create_fresh_int_array_#t~post25#1, create_fresh_int_array_~i~3#1, create_fresh_int_array_~size#1, create_fresh_int_array_~arr~0#1.base, create_fresh_int_array_~arr~0#1.offset; [2025-02-08 08:36:24,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-4: main_#t~ret12#1.base, main_#t~ret12#1.offset := create_fresh_int_array_#res#1.base, create_fresh_int_array_#res#1.offset; [2025-02-08 08:36:24,236 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:36:24,236 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:36:24,414 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:36:24,415 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:36:24,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:36:24 BoogieIcfgContainer [2025-02-08 08:36:24,416 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:36:24,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:36:24,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:36:24,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:36:24,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:36:23" (1/3) ... [2025-02-08 08:36:24,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f68cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:36:24, skipping insertion in model container [2025-02-08 08:36:24,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:36:23" (2/3) ... [2025-02-08 08:36:24,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f68cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:36:24, skipping insertion in model container [2025-02-08 08:36:24,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:36:24" (3/3) ... [2025-02-08 08:36:24,422 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-02-08 08:36:24,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:36:24,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 58 locations, 1 initial locations, 7 loop locations, and 26 error locations. [2025-02-08 08:36:24,433 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:36:24,472 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:36:24,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 63 transitions, 140 flow [2025-02-08 08:36:24,510 INFO L124 PetriNetUnfolderBase]: 6/61 cut-off events. [2025-02-08 08:36:24,511 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:36:24,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 61 events. 6/61 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-02-08 08:36:24,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 63 transitions, 140 flow [2025-02-08 08:36:24,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 59 transitions, 130 flow [2025-02-08 08:36:24,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:36:24,527 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;@5d4ddd91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:36:24,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-08 08:36:24,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:36:24,529 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:36:24,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:36:24,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:24,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:36:24,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash 605640, now seen corresponding path program 1 times [2025-02-08 08:36:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130349519] [2025-02-08 08:36:24,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:24,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:36:24,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:36:24,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:24,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:24,673 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:36:24,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:24,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130349519] [2025-02-08 08:36:24,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130349519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:24,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:36:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684466529] [2025-02-08 08:36:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:24,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:36:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:24,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:36:24,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:36:24,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2025-02-08 08:36:24,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:36:24,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:24,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2025-02-08 08:36:24,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:24,807 INFO L124 PetriNetUnfolderBase]: 57/174 cut-off events. [2025-02-08 08:36:24,807 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 08:36:24,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 174 events. 57/174 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 670 event pairs, 30 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 222. Up to 94 conditions per place. [2025-02-08 08:36:24,810 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 24 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-02-08 08:36:24,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 174 flow [2025-02-08 08:36:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:36:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:36:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-02-08 08:36:24,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6402116402116402 [2025-02-08 08:36:24,819 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 130 flow. Second operand 3 states and 121 transitions. [2025-02-08 08:36:24,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 174 flow [2025-02-08 08:36:24,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:36:24,824 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 118 flow [2025-02-08 08:36:24,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2025-02-08 08:36:24,827 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2025-02-08 08:36:24,827 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 118 flow [2025-02-08 08:36:24,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:36:24,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:24,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:36:24,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:36:24,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:24,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 605641, now seen corresponding path program 1 times [2025-02-08 08:36:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445187440] [2025-02-08 08:36:24,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:36:24,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:36:24,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:24,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 08:36:24,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695360526] [2025-02-08 08:36:24,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:24,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:24,856 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:36:24,858 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:36:24,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:36:24,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:36:24,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:24,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:24,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:36:24,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:24,992 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:36:25,210 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:36:25,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:36:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445187440] [2025-02-08 08:36:25,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 08:36:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695360526] [2025-02-08 08:36:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695360526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:36:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899519987] [2025-02-08 08:36:25,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:25,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:36:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:25,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:36:25,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:36:25,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2025-02-08 08:36:25,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:36:25,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:25,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2025-02-08 08:36:25,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:29,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 08:36:30,064 INFO L124 PetriNetUnfolderBase]: 58/177 cut-off events. [2025-02-08 08:36:30,064 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:36:30,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 177 events. 58/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 678 event pairs, 30 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 257. Up to 107 conditions per place. [2025-02-08 08:36:30,066 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 29 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-02-08 08:36:30,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 190 flow [2025-02-08 08:36:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:36:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:36:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-02-08 08:36:30,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-08 08:36:30,067 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 118 flow. Second operand 4 states and 154 transitions. [2025-02-08 08:36:30,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 190 flow [2025-02-08 08:36:30,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:36:30,069 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 139 flow [2025-02-08 08:36:30,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2025-02-08 08:36:30,070 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-02-08 08:36:30,070 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 139 flow [2025-02-08 08:36:30,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:36:30,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:30,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:36:30,076 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:36:30,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:30,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:30,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash 18777100, now seen corresponding path program 1 times [2025-02-08 08:36:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:30,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62837602] [2025-02-08 08:36:30,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:30,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:36:30,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:36:30,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:30,473 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:36:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:30,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62837602] [2025-02-08 08:36:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62837602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:30,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:36:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405045561] [2025-02-08 08:36:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:30,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:36:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:30,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:36:30,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:36:30,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 63 [2025-02-08 08:36:30,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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:36:30,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:30,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 63 [2025-02-08 08:36:30,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:30,589 INFO L124 PetriNetUnfolderBase]: 59/182 cut-off events. [2025-02-08 08:36:30,590 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:36:30,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 182 events. 59/182 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 712 event pairs, 30 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 273. Up to 105 conditions per place. [2025-02-08 08:36:30,591 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 27 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-02-08 08:36:30,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 215 flow [2025-02-08 08:36:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:36:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:36:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-02-08 08:36:30,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626984126984127 [2025-02-08 08:36:30,592 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 139 flow. Second operand 4 states and 167 transitions. [2025-02-08 08:36:30,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 215 flow [2025-02-08 08:36:30,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:36:30,593 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 170 flow [2025-02-08 08:36:30,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-02-08 08:36:30,597 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-02-08 08:36:30,598 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 170 flow [2025-02-08 08:36:30,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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:36:30,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:30,598 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:36:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:36:30,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:30,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash 582039471, now seen corresponding path program 1 times [2025-02-08 08:36:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188204871] [2025-02-08 08:36:30,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:30,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:36:30,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:36:30,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:30,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 08:36:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250043046] [2025-02-08 08:36:30,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:30,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:30,642 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:36:30,643 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:36:30,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:36:30,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:36:30,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:30,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:30,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:36:30,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:30,735 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:36:31,540 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:36:31,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:36:31,638 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:36:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188204871] [2025-02-08 08:36:31,638 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 08:36:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250043046] [2025-02-08 08:36:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250043046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:36:31,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:36:31,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-02-08 08:36:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385578743] [2025-02-08 08:36:31,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:36:31,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:36:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:31,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:36:31,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:36:35,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 08:36:36,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 63 [2025-02-08 08:36:36,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 170 flow. Second operand has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 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:36:36,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:36,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 63 [2025-02-08 08:36:36,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:37,327 INFO L124 PetriNetUnfolderBase]: 59/181 cut-off events. [2025-02-08 08:36:37,327 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:36:37,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 181 events. 59/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 699 event pairs, 30 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 279. Up to 106 conditions per place. [2025-02-08 08:36:37,329 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 27 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2025-02-08 08:36:37,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 238 flow [2025-02-08 08:36:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:36:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:36:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2025-02-08 08:36:37,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2025-02-08 08:36:37,331 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 170 flow. Second operand 7 states and 237 transitions. [2025-02-08 08:36:37,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 238 flow [2025-02-08 08:36:37,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:36:37,332 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 184 flow [2025-02-08 08:36:37,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-02-08 08:36:37,333 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-02-08 08:36:37,333 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 184 flow [2025-02-08 08:36:37,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 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:36:37,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:37,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:36:37,344 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:36:37,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:37,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:37,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash 863356646, now seen corresponding path program 1 times [2025-02-08 08:36:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9777262] [2025-02-08 08:36:37,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:37,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:36:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:36:37,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:37,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:37,809 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:36:37,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9777262] [2025-02-08 08:36:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9777262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248110390] [2025-02-08 08:36:37,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:37,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:37,812 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:36:37,813 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:36:37,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:36:37,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:36:37,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:37,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:37,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:36:37,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:37,881 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:36:37,963 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:36:37,963 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:36:37,985 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:36:37,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:36:38,055 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:36:38,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248110390] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:38,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:36:38,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-02-08 08:36:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532585514] [2025-02-08 08:36:38,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:38,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:36:38,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:38,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:36:38,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:36:38,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2025-02-08 08:36:38,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:36:38,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:38,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2025-02-08 08:36:38,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:38,321 INFO L124 PetriNetUnfolderBase]: 113/345 cut-off events. [2025-02-08 08:36:38,321 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:36:38,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 345 events. 113/345 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1719 event pairs, 60 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 299. Up to 105 conditions per place. [2025-02-08 08:36:38,323 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 51 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-02-08 08:36:38,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 81 transitions, 350 flow [2025-02-08 08:36:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:36:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:36:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2025-02-08 08:36:38,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6603174603174603 [2025-02-08 08:36:38,325 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 184 flow. Second operand 5 states and 208 transitions. [2025-02-08 08:36:38,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 81 transitions, 350 flow [2025-02-08 08:36:38,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 317 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 08:36:38,327 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 169 flow [2025-02-08 08:36:38,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-02-08 08:36:38,327 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-02-08 08:36:38,327 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 169 flow [2025-02-08 08:36:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:36:38,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:38,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:36:38,334 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:36:38,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:38,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:38,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash 864959788, now seen corresponding path program 1 times [2025-02-08 08:36:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:38,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565566178] [2025-02-08 08:36:38,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:38,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:36:38,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:36:38,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:38,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:38,692 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:36:38,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:38,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565566178] [2025-02-08 08:36:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565566178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:38,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:38,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:36:38,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323701406] [2025-02-08 08:36:38,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:38,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:36:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:38,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:36:38,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:36:38,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2025-02-08 08:36:38,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:36:38,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:38,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2025-02-08 08:36:38,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:38,909 INFO L124 PetriNetUnfolderBase]: 113/349 cut-off events. [2025-02-08 08:36:38,909 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:36:38,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 349 events. 113/349 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1761 event pairs, 60 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 295. Up to 205 conditions per place. [2025-02-08 08:36:38,911 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 30 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-02-08 08:36:38,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 247 flow [2025-02-08 08:36:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:36:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:36:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2025-02-08 08:36:38,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-02-08 08:36:38,912 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 169 flow. Second operand 5 states and 185 transitions. [2025-02-08 08:36:38,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 247 flow [2025-02-08 08:36:38,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:36:38,913 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 187 flow [2025-02-08 08:36:38,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-02-08 08:36:38,914 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-02-08 08:36:38,914 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 187 flow [2025-02-08 08:36:38,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:36:38,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:38,914 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:38,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:36:38,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:38,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1997280582, now seen corresponding path program 1 times [2025-02-08 08:36:38,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:38,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508893511] [2025-02-08 08:36:38,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:38,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:38,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:36:38,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:36:38,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:38,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:39,131 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:36:39,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:39,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508893511] [2025-02-08 08:36:39,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508893511] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:39,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795944509] [2025-02-08 08:36:39,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:39,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:39,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:39,136 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:36:39,137 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:36:39,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:36:39,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:36:39,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:39,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:39,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:36:39,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:39,213 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:36:39,355 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:36:39,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:36:39,493 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:36:39,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795944509] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:36:39,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:36:39,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:36:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889766754] [2025-02-08 08:36:39,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:36:39,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:36:39,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:39,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:36:39,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:36:39,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2025-02-08 08:36:39,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 187 flow. Second operand has 13 states, 13 states have (on average 31.615384615384617) internal successors, (411), 13 states have internal predecessors, (411), 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:36:39,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:39,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2025-02-08 08:36:39,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:40,339 INFO L124 PetriNetUnfolderBase]: 60/186 cut-off events. [2025-02-08 08:36:40,339 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:36:40,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 186 events. 60/186 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 732 event pairs, 30 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 311. Up to 103 conditions per place. [2025-02-08 08:36:40,340 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 24 selfloop transitions, 10 changer transitions 7/65 dead transitions. [2025-02-08 08:36:40,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 282 flow [2025-02-08 08:36:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:36:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:36:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 310 transitions. [2025-02-08 08:36:40,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54673721340388 [2025-02-08 08:36:40,342 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 187 flow. Second operand 9 states and 310 transitions. [2025-02-08 08:36:40,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 282 flow [2025-02-08 08:36:40,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:36:40,343 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 185 flow [2025-02-08 08:36:40,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=185, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2025-02-08 08:36:40,343 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2025-02-08 08:36:40,344 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 185 flow [2025-02-08 08:36:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 31.615384615384617) internal successors, (411), 13 states have internal predecessors, (411), 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:36:40,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:40,344 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:40,350 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:36:40,548 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:36:40,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash 757068019, now seen corresponding path program 1 times [2025-02-08 08:36:40,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:40,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778064987] [2025-02-08 08:36:40,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:40,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:36:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:36:40,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:40,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:36:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778064987] [2025-02-08 08:36:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778064987] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632787192] [2025-02-08 08:36:40,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:40,729 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:36:40,730 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:36:40,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:36:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:36:40,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:40,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:40,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:36:40,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:36:40,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:36:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:36:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632787192] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:36:40,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:36:40,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 08:36:40,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063976609] [2025-02-08 08:36:40,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:36:40,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:36:40,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:40,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:36:40,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:36:40,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 63 [2025-02-08 08:36:40,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 185 flow. Second operand has 13 states, 13 states have (on average 34.53846153846154) internal successors, (449), 13 states have internal predecessors, (449), 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:36:40,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:40,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 63 [2025-02-08 08:36:40,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:41,164 INFO L124 PetriNetUnfolderBase]: 114/348 cut-off events. [2025-02-08 08:36:41,164 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 08:36:41,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 348 events. 114/348 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1506 event pairs, 60 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 336. Up to 98 conditions per place. [2025-02-08 08:36:41,166 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 40 selfloop transitions, 18 changer transitions 0/83 dead transitions. [2025-02-08 08:36:41,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 375 flow [2025-02-08 08:36:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:36:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:36:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 356 transitions. [2025-02-08 08:36:41,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6278659611992945 [2025-02-08 08:36:41,169 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 185 flow. Second operand 9 states and 356 transitions. [2025-02-08 08:36:41,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 375 flow [2025-02-08 08:36:41,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 348 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 08:36:41,170 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 238 flow [2025-02-08 08:36:41,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=238, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-02-08 08:36:41,171 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2025-02-08 08:36:41,171 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 238 flow [2025-02-08 08:36:41,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 34.53846153846154) internal successors, (449), 13 states have internal predecessors, (449), 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:36:41,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:41,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:41,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:36:41,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:41,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:41,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1995872985, now seen corresponding path program 1 times [2025-02-08 08:36:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235087235] [2025-02-08 08:36:41,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:41,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:36:41,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:36:41,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:41,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:41,443 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:36:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235087235] [2025-02-08 08:36:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235087235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:41,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:41,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:36:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496351412] [2025-02-08 08:36:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:41,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:36:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:41,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:36:41,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:36:41,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 63 [2025-02-08 08:36:41,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:36:41,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:41,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 63 [2025-02-08 08:36:41,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:41,630 INFO L124 PetriNetUnfolderBase]: 189/571 cut-off events. [2025-02-08 08:36:41,630 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 08:36:41,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 571 events. 189/571 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3132 event pairs, 102 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 381. Up to 251 conditions per place. [2025-02-08 08:36:41,633 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 53 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2025-02-08 08:36:41,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 429 flow [2025-02-08 08:36:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:36:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:36:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 249 transitions. [2025-02-08 08:36:41,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-02-08 08:36:41,634 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 238 flow. Second operand 6 states and 249 transitions. [2025-02-08 08:36:41,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 429 flow [2025-02-08 08:36:41,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 89 transitions, 397 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 08:36:41,638 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 247 flow [2025-02-08 08:36:41,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-02-08 08:36:41,638 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2025-02-08 08:36:41,640 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 247 flow [2025-02-08 08:36:41,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:36:41,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:41,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-08 08:36:41,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:36:41,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash 168179405, now seen corresponding path program 2 times [2025-02-08 08:36:41,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:41,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278322123] [2025-02-08 08:36:41,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:36:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:41,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:36:41,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:36:41,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:36:41,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:36:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278322123] [2025-02-08 08:36:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278322123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756687739] [2025-02-08 08:36:41,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:36:41,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:41,856 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:36:41,858 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:36:41,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 08:36:41,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:36:41,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:36:41,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:41,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 08:36:41,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:41,930 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:36:42,046 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:36:42,046 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:36:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:36:42,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:36:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:36:42,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756687739] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:36:42,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:36:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-08 08:36:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853219257] [2025-02-08 08:36:42,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:36:42,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:36:42,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:42,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:36:42,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:36:43,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2025-02-08 08:36:43,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 247 flow. Second operand has 20 states, 20 states have (on average 31.5) internal successors, (630), 20 states have internal predecessors, (630), 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:36:43,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:43,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2025-02-08 08:36:43,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:44,175 INFO L124 PetriNetUnfolderBase]: 227/742 cut-off events. [2025-02-08 08:36:44,175 INFO L125 PetriNetUnfolderBase]: For 131/140 co-relation queries the response was YES. [2025-02-08 08:36:44,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 742 events. 227/742 cut-off events. For 131/140 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4125 event pairs, 120 based on Foata normal form. 6/536 useless extension candidates. Maximal degree in co-relation 744. Up to 287 conditions per place. [2025-02-08 08:36:44,178 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 52 selfloop transitions, 61 changer transitions 0/137 dead transitions. [2025-02-08 08:36:44,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 137 transitions, 822 flow [2025-02-08 08:36:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 08:36:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 08:36:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 834 transitions. [2025-02-08 08:36:44,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2025-02-08 08:36:44,182 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 247 flow. Second operand 24 states and 834 transitions. [2025-02-08 08:36:44,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 137 transitions, 822 flow [2025-02-08 08:36:44,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 137 transitions, 791 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:36:44,185 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 672 flow [2025-02-08 08:36:44,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=672, PETRI_PLACES=101, PETRI_TRANSITIONS=113} [2025-02-08 08:36:44,186 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 41 predicate places. [2025-02-08 08:36:44,186 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 672 flow [2025-02-08 08:36:44,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 31.5) internal successors, (630), 20 states have internal predecessors, (630), 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:36:44,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:44,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:44,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:36:44,387 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,SelfDestructingSolverStorable9 [2025-02-08 08:36:44,387 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 39080001, now seen corresponding path program 1 times [2025-02-08 08:36:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362154819] [2025-02-08 08:36:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:44,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:36:44,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:36:44,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:44,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:36:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362154819] [2025-02-08 08:36:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362154819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:36:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957951284] [2025-02-08 08:36:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:36:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:44,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:36:44,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:36:44,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 63 [2025-02-08 08:36:44,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 113 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:36:44,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:44,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 63 [2025-02-08 08:36:44,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:44,553 INFO L124 PetriNetUnfolderBase]: 265/834 cut-off events. [2025-02-08 08:36:44,553 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-02-08 08:36:44,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 834 events. 265/834 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4830 event pairs, 152 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 1356. Up to 448 conditions per place. [2025-02-08 08:36:44,557 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 70 selfloop transitions, 20 changer transitions 0/111 dead transitions. [2025-02-08 08:36:44,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 111 transitions, 848 flow [2025-02-08 08:36:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:36:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:36:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-02-08 08:36:44,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6084656084656085 [2025-02-08 08:36:44,558 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 672 flow. Second operand 3 states and 115 transitions. [2025-02-08 08:36:44,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 111 transitions, 848 flow [2025-02-08 08:36:44,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 111 transitions, 826 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-02-08 08:36:44,563 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 686 flow [2025-02-08 08:36:44,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=101, PETRI_TRANSITIONS=111} [2025-02-08 08:36:44,563 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 41 predicate places. [2025-02-08 08:36:44,563 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 686 flow [2025-02-08 08:36:44,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:36:44,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:44,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:44,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:36:44,564 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash 39080002, now seen corresponding path program 1 times [2025-02-08 08:36:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614531566] [2025-02-08 08:36:44,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:44,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:44,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:36:44,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:36:44,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:44,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:36:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614531566] [2025-02-08 08:36:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614531566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:44,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:36:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061054758] [2025-02-08 08:36:44,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:44,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:36:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:44,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:36:44,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:36:44,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 63 [2025-02-08 08:36:44,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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:36:44,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:44,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 63 [2025-02-08 08:36:44,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:44,719 INFO L124 PetriNetUnfolderBase]: 133/414 cut-off events. [2025-02-08 08:36:44,719 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2025-02-08 08:36:44,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 414 events. 133/414 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1833 event pairs, 56 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 857. Up to 162 conditions per place. [2025-02-08 08:36:44,721 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 57 selfloop transitions, 18 changer transitions 15/97 dead transitions. [2025-02-08 08:36:44,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 97 transitions, 851 flow [2025-02-08 08:36:44,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:36:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:36:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2025-02-08 08:36:44,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6063492063492063 [2025-02-08 08:36:44,722 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 686 flow. Second operand 5 states and 191 transitions. [2025-02-08 08:36:44,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 97 transitions, 851 flow [2025-02-08 08:36:44,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 97 transitions, 827 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 08:36:44,726 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 571 flow [2025-02-08 08:36:44,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=571, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-02-08 08:36:44,727 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 25 predicate places. [2025-02-08 08:36:44,727 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 571 flow [2025-02-08 08:36:44,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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:36:44,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:44,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:44,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:36:44,728 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:44,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash -886307186, now seen corresponding path program 1 times [2025-02-08 08:36:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921239484] [2025-02-08 08:36:44,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:44,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:36:44,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:36:44,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:44,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:44,818 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:36:44,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921239484] [2025-02-08 08:36:44,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921239484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:36:44,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:36:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:36:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518043916] [2025-02-08 08:36:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:44,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:36:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:44,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:36:44,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:36:44,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-02-08 08:36:44,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 571 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:36:44,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:44,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-02-08 08:36:44,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:44,895 INFO L124 PetriNetUnfolderBase]: 101/255 cut-off events. [2025-02-08 08:36:44,895 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2025-02-08 08:36:44,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 255 events. 101/255 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 853 event pairs, 60 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 624. Up to 174 conditions per place. [2025-02-08 08:36:44,896 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 57 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2025-02-08 08:36:44,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 715 flow [2025-02-08 08:36:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:36:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:36:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-02-08 08:36:44,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2025-02-08 08:36:44,898 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 571 flow. Second operand 4 states and 122 transitions. [2025-02-08 08:36:44,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 715 flow [2025-02-08 08:36:44,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 673 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 08:36:44,900 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 559 flow [2025-02-08 08:36:44,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=559, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2025-02-08 08:36:44,901 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-02-08 08:36:44,901 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 559 flow [2025-02-08 08:36:44,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:36:44,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:44,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:44,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:36:44,902 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:44,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash -886307185, now seen corresponding path program 1 times [2025-02-08 08:36:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676854451] [2025-02-08 08:36:44,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:44,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:36:44,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:36:44,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:44,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:45,076 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:36:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676854451] [2025-02-08 08:36:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676854451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705073632] [2025-02-08 08:36:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:36:45,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:45,078 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:36:45,080 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:36:45,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:36:45,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:36:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:36:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:45,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:36:45,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:45,206 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:36:45,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:36:45,249 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:36:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705073632] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:45,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:36:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 12 [2025-02-08 08:36:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821236422] [2025-02-08 08:36:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:36:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:36:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:45,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:36:45,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:36:45,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 63 [2025-02-08 08:36:45,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 559 flow. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 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:36:45,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:45,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 63 [2025-02-08 08:36:45,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:45,291 INFO L124 PetriNetUnfolderBase]: 17/72 cut-off events. [2025-02-08 08:36:45,291 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-02-08 08:36:45,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 72 events. 17/72 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 3/75 useless extension candidates. Maximal degree in co-relation 323. Up to 51 conditions per place. [2025-02-08 08:36:45,292 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 25 selfloop transitions, 2 changer transitions 36/64 dead transitions. [2025-02-08 08:36:45,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 655 flow [2025-02-08 08:36:45,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:36:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:36:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-02-08 08:36:45,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-02-08 08:36:45,292 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 559 flow. Second operand 5 states and 174 transitions. [2025-02-08 08:36:45,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 655 flow [2025-02-08 08:36:45,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:36:45,294 INFO L231 Difference]: Finished difference. Result has 61 places, 28 transitions, 223 flow [2025-02-08 08:36:45,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=61, PETRI_TRANSITIONS=28} [2025-02-08 08:36:45,295 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2025-02-08 08:36:45,295 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 28 transitions, 223 flow [2025-02-08 08:36:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 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:36:45,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:36:45,295 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1] [2025-02-08 08:36:45,301 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:36:45,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:45,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-02-08 08:36:45,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:36:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1775043275, now seen corresponding path program 3 times [2025-02-08 08:36:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:36:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96468552] [2025-02-08 08:36:45,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:36:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:36:45,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 8 equivalence classes. [2025-02-08 08:36:45,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 18 statements. [2025-02-08 08:36:45,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:36:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 08:36:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:36:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96468552] [2025-02-08 08:36:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96468552] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:36:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440868830] [2025-02-08 08:36:45,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:36:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:36:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:36:45,759 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:36:45,760 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:36:45,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 8 equivalence classes. [2025-02-08 08:36:45,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 18 statements. [2025-02-08 08:36:45,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:36:45,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:36:45,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 08:36:45,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:36:45,835 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:36:45,966 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:36:45,966 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 25 treesize of output 22 [2025-02-08 08:36:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 08:36:46,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:36:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 08:36:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440868830] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:36:46,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:36:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-02-08 08:36:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618393965] [2025-02-08 08:36:46,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:36:46,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:36:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:36:46,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:36:46,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:36:47,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2025-02-08 08:36:47,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 28 transitions, 223 flow. Second operand has 17 states, 17 states have (on average 31.58823529411765) internal successors, (537), 17 states have internal predecessors, (537), 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:36:47,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:36:47,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2025-02-08 08:36:47,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:36:47,640 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2025-02-08 08:36:47,640 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-02-08 08:36:47,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 28 events. 2/28 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 2 event pairs, 0 based on Foata normal form. 5/33 useless extension candidates. Maximal degree in co-relation 136. Up to 14 conditions per place. [2025-02-08 08:36:47,641 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2025-02-08 08:36:47,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 28 transitions, 270 flow [2025-02-08 08:36:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:36:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:36:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions. [2025-02-08 08:36:47,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2025-02-08 08:36:47,642 INFO L175 Difference]: Start difference. First operand has 61 places, 28 transitions, 223 flow. Second operand 8 states and 256 transitions. [2025-02-08 08:36:47,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 28 transitions, 270 flow [2025-02-08 08:36:47,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 204 flow, removed 4 selfloop flow, removed 19 redundant places. [2025-02-08 08:36:47,642 INFO L231 Difference]: Finished difference. Result has 37 places, 0 transitions, 0 flow [2025-02-08 08:36:47,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=37, PETRI_TRANSITIONS=0} [2025-02-08 08:36:47,643 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -23 predicate places. [2025-02-08 08:36:47,643 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 0 transitions, 0 flow [2025-02-08 08:36:47,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 31.58823529411765) internal successors, (537), 17 states have internal predecessors, (537), 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:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-02-08 08:36:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (13 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (12 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-02-08 08:36:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-02-08 08:36:47,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:36:47,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 08:36:47,850 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:36:47,854 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:36:47,854 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:36:47,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:36:47 BasicIcfg [2025-02-08 08:36:47,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:36:47,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:36:47,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:36:47,857 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:36:47,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:36:24" (3/4) ... [2025-02-08 08:36:47,860 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:36:47,862 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:36:47,862 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:36:47,871 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 146 nodes and edges [2025-02-08 08:36:47,871 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-02-08 08:36:47,872 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 08:36:47,872 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:36:47,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:36:47,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:36:47,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:36:47,940 INFO L158 Benchmark]: Toolchain (without parser) took 24495.82ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 109.9MB in the beginning and 239.7MB in the end (delta: -129.8MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2025-02-08 08:36:47,940 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:36:47,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.03ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:36:47,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.34ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:36:47,941 INFO L158 Benchmark]: Boogie Preprocessor took 62.08ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:36:47,941 INFO L158 Benchmark]: IcfgBuilder took 647.11ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 99.5MB in the end (delta: -5.6MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-02-08 08:36:47,941 INFO L158 Benchmark]: TraceAbstraction took 23439.30ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 99.2MB in the beginning and 247.4MB in the end (delta: -148.1MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2025-02-08 08:36:47,941 INFO L158 Benchmark]: Witness Printer took 82.18ms. Allocated memory is still 327.2MB. Free memory was 247.4MB in the beginning and 239.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:36:47,942 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.30ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.03ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.34ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.08ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 647.11ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 99.5MB in the end (delta: -5.6MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23439.30ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 99.2MB in the beginning and 247.4MB in the end (delta: -148.1MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Witness Printer took 82.18ms. Allocated memory is still 327.2MB. Free memory was 247.4MB in the beginning and 239.7MB in the end (delta: 7.7MB). 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 65]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 82 locations, 36 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: 23.4s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1943 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1558 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 12.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5586 IncrementalHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 51 mSDtfsCounter, 5586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=11, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 195 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 226 ConstructedInterpolants, 20 QuantifiedInterpolants, 3318 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1023 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 299/389 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 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:36:47,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE