./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-symm.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/chl-chromosome-symm.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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:34:20,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:34:20,966 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:34:20,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:34:20,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:34:20,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:34:20,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:34:20,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:34:20,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:34:20,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:34:20,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:34:20,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:34:20,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:34:20,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:34:20,986 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:34:20,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:34:20,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:34:20,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:34:20,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:34:20,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:34:20,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:34:20,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:34:20,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:34:20,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:34:20,989 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-02-08 08:34:21,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:34:21,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:34:21,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:34:21,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:34:21,203 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:34:21,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-02-08 08:34:22,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45bba9fb7/f0a3e08b82834e5cb79ae0984ec2f989/FLAGe362b5a2a [2025-02-08 08:34:22,594 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:34:22,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-02-08 08:34:22,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45bba9fb7/f0a3e08b82834e5cb79ae0984ec2f989/FLAGe362b5a2a [2025-02-08 08:34:22,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45bba9fb7/f0a3e08b82834e5cb79ae0984ec2f989 [2025-02-08 08:34:22,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:34:22,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:34:22,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:34:22,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:34:22,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:34:22,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:34:22" (1/1) ... [2025-02-08 08:34:22,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a98e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:22, skipping insertion in model container [2025-02-08 08:34:22,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:34:22" (1/1) ... [2025-02-08 08:34:22,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:34:23,052 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:34:23,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:34:23,064 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:34:23,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:34:23,088 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:34:23,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23 WrapperNode [2025-02-08 08:34:23,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:34:23,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:34:23,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:34:23,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:34:23,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,102 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:34:23" (1/1) ... [2025-02-08 08:34:23,126 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 181 [2025-02-08 08:34:23,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:34:23,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:34:23,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:34:23,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:34:23,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,154 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 08:34:23,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,164 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:34:23,173 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:34:23,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:34:23,173 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:34:23,174 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (1/1) ... [2025-02-08 08:34:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:34:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:23,200 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:34:23,203 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:34:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:34:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:34:23,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:34:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:34:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:34:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:34:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:34:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:34:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:34:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:34:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:34:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:34:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:34:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:34:23,222 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:34:23,294 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:34:23,295 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:34:23,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~post4#1; [2025-02-08 08:34:23,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: ~i~0#1 := 1 + #t~post4#1; [2025-02-08 08:34:23,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: #t~post4#1 := ~i~0#1; [2025-02-08 08:34:23,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: havoc #t~ret3#1; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-1: havoc #t~mem2#1; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: havoc #t~mem1#1; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: ~result_5~0 := #t~ret3#1; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-7: #t~ret3#1 := minus_#res#1; [2025-02-08 08:34:23,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: ~stop~0#1 := (if 0 == (if 0 != ~result_5~0 then 1 else 0) then 0 else 1); [2025-02-08 08:34:23,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: ~result_8~0 := #t~ret7#1; [2025-02-08 08:34:23,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 08:34:23,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:34:23,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: #t~ret7#1 := minus_#res#1; [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: ~stop~1#1 := (if 0 == (if 0 != ~result_8~0 then 1 else 0) then 0 else 1); [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~post8#1; [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~i~1#1 := 1 + #t~post8#1; [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: #t~post8#1 := ~i~1#1; [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~ret7#1; [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~mem6#1; [2025-02-08 08:34:23,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: havoc #t~mem5#1; [2025-02-08 08:34:23,551 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:34:23,551 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:34:23,765 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:34:23,766 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:34:23,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:34:23 BoogieIcfgContainer [2025-02-08 08:34:23,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:34:23,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:34:23,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:34:23,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:34:23,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:34:22" (1/3) ... [2025-02-08 08:34:23,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d56c1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:34:23, skipping insertion in model container [2025-02-08 08:34:23,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:23" (2/3) ... [2025-02-08 08:34:23,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d56c1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:34:23, skipping insertion in model container [2025-02-08 08:34:23,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:34:23" (3/3) ... [2025-02-08 08:34:23,774 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-02-08 08:34:23,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:34:23,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-02-08 08:34:23,787 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:34:23,836 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:34:23,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 98 flow [2025-02-08 08:34:23,885 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-02-08 08:34:23,887 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:34:23,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 2/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-02-08 08:34:23,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 98 flow [2025-02-08 08:34:23,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 39 transitions, 90 flow [2025-02-08 08:34:23,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:34:23,906 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;@11ce5404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:34:23,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 08:34:23,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:34:23,908 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:34:23,910 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:34:23,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:23,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:34:23,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:23,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 525396, now seen corresponding path program 1 times [2025-02-08 08:34:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:23,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325289610] [2025-02-08 08:34:23,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:23,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:34:23,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:34:23,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:23,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:24,070 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:34:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325289610] [2025-02-08 08:34:24,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325289610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:34:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627696830] [2025-02-08 08:34:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:24,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:34:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:24,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:34:24,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:34:24,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 08:34:24,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:34:24,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:24,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 08:34:24,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:24,236 INFO L124 PetriNetUnfolderBase]: 44/128 cut-off events. [2025-02-08 08:34:24,238 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:34:24,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 128 events. 44/128 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 534 event pairs, 42 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 194. Up to 90 conditions per place. [2025-02-08 08:34:24,241 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 18 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-02-08 08:34:24,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 122 flow [2025-02-08 08:34:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:34:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:34:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-08 08:34:24,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-08 08:34:24,251 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 90 flow. Second operand 3 states and 77 transitions. [2025-02-08 08:34:24,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 122 flow [2025-02-08 08:34:24,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:34:24,255 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 78 flow [2025-02-08 08:34:24,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-02-08 08:34:24,258 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2025-02-08 08:34:24,258 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 78 flow [2025-02-08 08:34:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:34:24,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:24,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:34:24,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:34:24,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash 525397, now seen corresponding path program 1 times [2025-02-08 08:34:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074070160] [2025-02-08 08:34:24,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:24,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:34:24,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:34:24,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:24,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:24,450 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:34:24,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:24,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074070160] [2025-02-08 08:34:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074070160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:34:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437336398] [2025-02-08 08:34:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:24,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:24,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:24,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:24,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:24,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 08:34:24,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:34:24,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:24,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 08:34:24,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:24,541 INFO L124 PetriNetUnfolderBase]: 44/132 cut-off events. [2025-02-08 08:34:24,541 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:34:24,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 132 events. 44/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 524 event pairs, 42 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 212. Up to 98 conditions per place. [2025-02-08 08:34:24,543 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 22 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-02-08 08:34:24,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 138 flow [2025-02-08 08:34:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:34:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:34:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-08 08:34:24,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 08:34:24,546 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 78 flow. Second operand 3 states and 84 transitions. [2025-02-08 08:34:24,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 138 flow [2025-02-08 08:34:24,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:34:24,548 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 100 flow [2025-02-08 08:34:24,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-02-08 08:34:24,549 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-02-08 08:34:24,549 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 100 flow [2025-02-08 08:34:24,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:34:24,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:24,549 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:34:24,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:34:24,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:24,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash 504923545, now seen corresponding path program 1 times [2025-02-08 08:34:24,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:24,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631961368] [2025-02-08 08:34:24,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:24,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:24,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:34:24,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:34:24,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:24,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:24,856 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:34:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631961368] [2025-02-08 08:34:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631961368] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220182250] [2025-02-08 08:34:24,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:24,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:24,861 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:34:24,863 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:34:24,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:34:24,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:34:24,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:24,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:24,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:34:24,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:24,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:24,969 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:34:24,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:25,016 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:34:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220182250] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:25,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:25,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-02-08 08:34:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762565747] [2025-02-08 08:34:25,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:25,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:34:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:25,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:34:25,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:34:25,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 08:34:25,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 100 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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:34:25,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:25,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 08:34:25,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:25,274 INFO L124 PetriNetUnfolderBase]: 48/148 cut-off events. [2025-02-08 08:34:25,274 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:34:25,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 148 events. 48/148 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 565 event pairs, 42 based on Foata normal form. 2/126 useless extension candidates. Maximal degree in co-relation 244. Up to 100 conditions per place. [2025-02-08 08:34:25,275 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2025-02-08 08:34:25,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 242 flow [2025-02-08 08:34:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-02-08 08:34:25,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2025-02-08 08:34:25,277 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 100 flow. Second operand 6 states and 158 transitions. [2025-02-08 08:34:25,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 242 flow [2025-02-08 08:34:25,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:34:25,278 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 198 flow [2025-02-08 08:34:25,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2025-02-08 08:34:25,279 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-02-08 08:34:25,279 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 198 flow [2025-02-08 08:34:25,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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:34:25,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:25,279 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-08 08:34:25,288 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:34:25,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:25,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:25,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 281510757, now seen corresponding path program 2 times [2025-02-08 08:34:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:25,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432095450] [2025-02-08 08:34:25,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:34:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:25,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:34:25,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:34:25,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:34:25,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:34:25,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432095450] [2025-02-08 08:34:25,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432095450] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103987441] [2025-02-08 08:34:25,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:34:25,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:25,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:25,717 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:34:25,724 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:34:25,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:34:25,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:34:25,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:34:25,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:25,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:34:25,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:25,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:34:25,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:34:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103987441] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:26,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-02-08 08:34:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395873901] [2025-02-08 08:34:26,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:26,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:34:26,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:26,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:34:26,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:34:26,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 08:34:26,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 198 flow. Second operand has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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:34:26,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:26,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 08:34:26,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:26,714 INFO L124 PetriNetUnfolderBase]: 50/152 cut-off events. [2025-02-08 08:34:26,714 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 08:34:26,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 152 events. 50/152 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 575 event pairs, 42 based on Foata normal form. 4/134 useless extension candidates. Maximal degree in co-relation 256. Up to 93 conditions per place. [2025-02-08 08:34:26,716 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 23 selfloop transitions, 23 changer transitions 0/59 dead transitions. [2025-02-08 08:34:26,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 314 flow [2025-02-08 08:34:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:34:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:34:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2025-02-08 08:34:26,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608465608465608 [2025-02-08 08:34:26,719 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 198 flow. Second operand 9 states and 212 transitions. [2025-02-08 08:34:26,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 314 flow [2025-02-08 08:34:26,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 256 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-02-08 08:34:26,721 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 206 flow [2025-02-08 08:34:26,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2025-02-08 08:34:26,722 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-02-08 08:34:26,722 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 51 transitions, 206 flow [2025-02-08 08:34:26,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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:34:26,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:26,723 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:26,731 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:34:26,927 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:34:26,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash -540065225, now seen corresponding path program 1 times [2025-02-08 08:34:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022249330] [2025-02-08 08:34:26,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:26,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:34:26,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:34:26,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:26,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:34:27,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:27,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022249330] [2025-02-08 08:34:27,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022249330] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:27,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727104867] [2025-02-08 08:34:27,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:27,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:27,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:27,003 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:34:27,004 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:34:27,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:34:27,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:34:27,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:27,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:27,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:34:27,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:34:27,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:34:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727104867] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:27,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:34:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045354876] [2025-02-08 08:34:27,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:27,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:34:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:27,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:34:27,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:34:27,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-08 08:34:27,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 206 flow. Second operand has 10 states, 10 states have (on average 22.3) internal successors, (223), 10 states have internal predecessors, (223), 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:34:27,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:27,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-08 08:34:27,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:27,246 INFO L124 PetriNetUnfolderBase]: 44/146 cut-off events. [2025-02-08 08:34:27,247 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 08:34:27,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 146 events. 44/146 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 520 event pairs, 42 based on Foata normal form. 6/130 useless extension candidates. Maximal degree in co-relation 212. Up to 94 conditions per place. [2025-02-08 08:34:27,248 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 24 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2025-02-08 08:34:27,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 282 flow [2025-02-08 08:34:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:34:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:34:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2025-02-08 08:34:27,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6258503401360545 [2025-02-08 08:34:27,250 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 206 flow. Second operand 7 states and 184 transitions. [2025-02-08 08:34:27,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 282 flow [2025-02-08 08:34:27,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 250 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 08:34:27,252 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 170 flow [2025-02-08 08:34:27,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-02-08 08:34:27,253 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-02-08 08:34:27,253 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 170 flow [2025-02-08 08:34:27,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.3) internal successors, (223), 10 states have internal predecessors, (223), 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:34:27,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:27,254 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:27,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:34:27,459 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:34:27,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:27,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 964838910, now seen corresponding path program 2 times [2025-02-08 08:34:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:27,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460725779] [2025-02-08 08:34:27,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:34:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:27,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 08:34:27,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 27 statements. [2025-02-08 08:34:27,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:34:27,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460725779] [2025-02-08 08:34:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460725779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:34:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233311283] [2025-02-08 08:34:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:27,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:27,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:27,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-02-08 08:34:27,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:34:27,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:27,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-02-08 08:34:27,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:27,614 INFO L124 PetriNetUnfolderBase]: 56/162 cut-off events. [2025-02-08 08:34:27,614 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 08:34:27,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 162 events. 56/162 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 564 event pairs, 54 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 254. Up to 111 conditions per place. [2025-02-08 08:34:27,615 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-02-08 08:34:27,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 232 flow [2025-02-08 08:34:27,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:34:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:34:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-02-08 08:34:27,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-08 08:34:27,616 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 170 flow. Second operand 5 states and 98 transitions. [2025-02-08 08:34:27,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 232 flow [2025-02-08 08:34:27,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 200 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:34:27,619 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 140 flow [2025-02-08 08:34:27,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-02-08 08:34:27,619 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-02-08 08:34:27,619 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 140 flow [2025-02-08 08:34:27,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:34:27,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:27,619 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:27,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:34:27,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:27,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash 964838911, now seen corresponding path program 1 times [2025-02-08 08:34:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:27,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032131128] [2025-02-08 08:34:27,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:34:27,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:34:27,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:27,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 08:34:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032131128] [2025-02-08 08:34:27,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032131128] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547607497] [2025-02-08 08:34:27,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:27,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:27,949 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:34:27,953 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:34:28,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:34:28,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:34:28,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:28,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:28,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 08:34:28,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:28,042 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:34:28,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:28,123 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:34:28,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:34:28,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 08:34:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:28,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547607497] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:28,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:34:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 21 [2025-02-08 08:34:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075279851] [2025-02-08 08:34:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:28,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:34:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:28,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:34:28,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-02-08 08:34:28,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 08:34:28,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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:34:28,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:28,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 08:34:28,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:29,059 INFO L124 PetriNetUnfolderBase]: 56/173 cut-off events. [2025-02-08 08:34:29,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:34:29,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 173 events. 56/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 699 event pairs, 3 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 262. Up to 97 conditions per place. [2025-02-08 08:34:29,060 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 35 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-02-08 08:34:29,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 229 flow [2025-02-08 08:34:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-02-08 08:34:29,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-02-08 08:34:29,062 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 140 flow. Second operand 6 states and 136 transitions. [2025-02-08 08:34:29,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 229 flow [2025-02-08 08:34:29,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:34:29,064 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 141 flow [2025-02-08 08:34:29,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-02-08 08:34:29,064 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-02-08 08:34:29,064 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 141 flow [2025-02-08 08:34:29,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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:34:29,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:29,064 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:29,071 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:34:29,265 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:34:29,265 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash -154764362, now seen corresponding path program 1 times [2025-02-08 08:34:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362811679] [2025-02-08 08:34:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:34:29,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:34:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-08 08:34:29,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362811679] [2025-02-08 08:34:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362811679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614341221] [2025-02-08 08:34:29,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:29,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:29,511 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:34:29,512 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:34:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:34:29,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:34:29,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:29,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:29,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:34:29,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:29,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:29,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 08:34:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614341221] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:29,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:29,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-02-08 08:34:29,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001978035] [2025-02-08 08:34:29,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:29,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 08:34:29,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:29,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 08:34:29,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-08 08:34:30,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-08 08:34:30,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 141 flow. Second operand has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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:34:30,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:30,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-08 08:34:30,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:30,362 INFO L124 PetriNetUnfolderBase]: 44/151 cut-off events. [2025-02-08 08:34:30,363 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 08:34:30,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 151 events. 44/151 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 563 event pairs, 3 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 227. Up to 75 conditions per place. [2025-02-08 08:34:30,364 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 34 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2025-02-08 08:34:30,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 276 flow [2025-02-08 08:34:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:34:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:34:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2025-02-08 08:34:30,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5661375661375662 [2025-02-08 08:34:30,365 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 141 flow. Second operand 9 states and 214 transitions. [2025-02-08 08:34:30,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 276 flow [2025-02-08 08:34:30,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 269 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:34:30,368 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 156 flow [2025-02-08 08:34:30,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-02-08 08:34:30,369 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-02-08 08:34:30,369 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 156 flow [2025-02-08 08:34:30,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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:34:30,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:30,369 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:30,378 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:34:30,569 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:34:30,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -154764363, now seen corresponding path program 1 times [2025-02-08 08:34:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179869808] [2025-02-08 08:34:30,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:30,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:30,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:34:30,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:34:30,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:30,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 08:34:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:30,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179869808] [2025-02-08 08:34:30,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179869808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:30,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:30,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:34:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847856098] [2025-02-08 08:34:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:30,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:30,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:30,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:30,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:30,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-02-08 08:34:30,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:30,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:30,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-02-08 08:34:30,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:30,705 INFO L124 PetriNetUnfolderBase]: 55/150 cut-off events. [2025-02-08 08:34:30,705 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 08:34:30,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 150 events. 55/150 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 483 event pairs, 53 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 260. Up to 109 conditions per place. [2025-02-08 08:34:30,706 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 30 selfloop transitions, 2 changer transitions 1/39 dead transitions. [2025-02-08 08:34:30,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 218 flow [2025-02-08 08:34:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:34:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:34:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-08 08:34:30,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-02-08 08:34:30,707 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 156 flow. Second operand 4 states and 83 transitions. [2025-02-08 08:34:30,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 218 flow [2025-02-08 08:34:30,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 195 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 08:34:30,708 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 131 flow [2025-02-08 08:34:30,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-02-08 08:34:30,709 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2025-02-08 08:34:30,709 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 131 flow [2025-02-08 08:34:30,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:30,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:30,709 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:30,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:34:30,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:30,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash -524290213, now seen corresponding path program 1 times [2025-02-08 08:34:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438682632] [2025-02-08 08:34:30,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:34:30,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:34:30,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:30,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-08 08:34:30,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438682632] [2025-02-08 08:34:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438682632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779125091] [2025-02-08 08:34:30,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:30,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:30,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:30,883 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:34:30,885 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:34:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:34:30,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:34:30,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:30,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:30,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:34:30,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:31,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 08:34:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779125091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:31,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:31,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-02-08 08:34:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147678569] [2025-02-08 08:34:31,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:31,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 08:34:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:31,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 08:34:31,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-08 08:34:31,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 08:34:31,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 131 flow. Second operand has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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:34:31,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:31,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 08:34:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:31,640 INFO L124 PetriNetUnfolderBase]: 44/136 cut-off events. [2025-02-08 08:34:31,640 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:34:31,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 136 events. 44/136 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 420 event pairs, 9 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 222. Up to 62 conditions per place. [2025-02-08 08:34:31,641 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2025-02-08 08:34:31,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 264 flow [2025-02-08 08:34:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:34:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:34:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-02-08 08:34:31,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-02-08 08:34:31,642 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 131 flow. Second operand 9 states and 204 transitions. [2025-02-08 08:34:31,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 264 flow [2025-02-08 08:34:31,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:34:31,643 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 150 flow [2025-02-08 08:34:31,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=150, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-08 08:34:31,644 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-02-08 08:34:31,644 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 150 flow [2025-02-08 08:34:31,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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:34:31,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:31,644 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:31,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:34:31,844 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:34:31,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 926873059, now seen corresponding path program 1 times [2025-02-08 08:34:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003685275] [2025-02-08 08:34:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:31,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:34:31,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:34:31,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:31,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 08:34:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003685275] [2025-02-08 08:34:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003685275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280585860] [2025-02-08 08:34:32,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:32,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:32,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:32,029 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:34:32,030 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:34:32,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:34:32,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:34:32,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:32,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:32,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 08:34:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:32,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:32,157 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 08:34:32,157 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 12 treesize of output 14 [2025-02-08 08:34:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:32,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:32,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280585860] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:32,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:34:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 9] total 22 [2025-02-08 08:34:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645970651] [2025-02-08 08:34:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:32,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:34:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:32,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:34:32,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-02-08 08:34:32,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-08 08:34:32,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 150 flow. Second operand has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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:34:32,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:32,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-08 08:34:32,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:32,788 INFO L124 PetriNetUnfolderBase]: 33/116 cut-off events. [2025-02-08 08:34:32,788 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 08:34:32,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 116 events. 33/116 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 9 based on Foata normal form. 9/123 useless extension candidates. Maximal degree in co-relation 187. Up to 42 conditions per place. [2025-02-08 08:34:32,788 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 4 changer transitions 2/41 dead transitions. [2025-02-08 08:34:32,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 233 flow [2025-02-08 08:34:32,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-02-08 08:34:32,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2025-02-08 08:34:32,789 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 150 flow. Second operand 6 states and 139 transitions. [2025-02-08 08:34:32,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 233 flow [2025-02-08 08:34:32,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 210 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 08:34:32,790 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 131 flow [2025-02-08 08:34:32,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-02-08 08:34:32,791 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-02-08 08:34:32,791 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 131 flow [2025-02-08 08:34:32,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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:34:32,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:32,792 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:32,797 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:34:32,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:32,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash 394490219, now seen corresponding path program 1 times [2025-02-08 08:34:32,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:32,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276200603] [2025-02-08 08:34:32,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:33,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:34:33,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:34:33,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:33,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276200603] [2025-02-08 08:34:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276200603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:34:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962563681] [2025-02-08 08:34:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:33,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:33,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:33,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:33,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-08 08:34:33,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:33,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:33,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-08 08:34:33,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:33,262 INFO L124 PetriNetUnfolderBase]: 21/94 cut-off events. [2025-02-08 08:34:33,262 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:34:33,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 94 events. 21/94 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 238 event pairs, 2 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 143. Up to 38 conditions per place. [2025-02-08 08:34:33,263 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 35 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2025-02-08 08:34:33,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 232 flow [2025-02-08 08:34:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:34:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:34:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-08 08:34:33,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-02-08 08:34:33,266 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 131 flow. Second operand 4 states and 108 transitions. [2025-02-08 08:34:33,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 232 flow [2025-02-08 08:34:33,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:34:33,267 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 131 flow [2025-02-08 08:34:33,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-02-08 08:34:33,267 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2025-02-08 08:34:33,268 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 131 flow [2025-02-08 08:34:33,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:33,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:33,268 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:33,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:34:33,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1051014825, now seen corresponding path program 2 times [2025-02-08 08:34:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011557399] [2025-02-08 08:34:33,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:34:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:33,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:34:33,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-02-08 08:34:33,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:34:33,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:33,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011557399] [2025-02-08 08:34:33,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011557399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:33,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:33,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:34:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928287484] [2025-02-08 08:34:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:33,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:33,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:33,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:33,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-08 08:34:33,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:33,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:33,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-08 08:34:33,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:33,415 INFO L124 PetriNetUnfolderBase]: 19/86 cut-off events. [2025-02-08 08:34:33,415 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 08:34:33,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 86 events. 19/86 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 6 based on Foata normal form. 2/86 useless extension candidates. Maximal degree in co-relation 147. Up to 47 conditions per place. [2025-02-08 08:34:33,415 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2025-02-08 08:34:33,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 231 flow [2025-02-08 08:34:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:34:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:34:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-08 08:34:33,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-02-08 08:34:33,418 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 131 flow. Second operand 4 states and 106 transitions. [2025-02-08 08:34:33,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 231 flow [2025-02-08 08:34:33,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:34:33,419 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 135 flow [2025-02-08 08:34:33,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-02-08 08:34:33,419 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-02-08 08:34:33,419 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 135 flow [2025-02-08 08:34:33,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:33,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:33,419 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:33,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:34:33,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:33,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1162439093, now seen corresponding path program 3 times [2025-02-08 08:34:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069564117] [2025-02-08 08:34:33,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:34:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:33,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-02-08 08:34:33,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-02-08 08:34:33,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:34:33,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:33,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069564117] [2025-02-08 08:34:33,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069564117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:33,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:33,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:34:33,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046432841] [2025-02-08 08:34:33,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:33,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:33,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:33,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:33,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-08 08:34:33,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:34:33,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:33,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-08 08:34:33,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:33,659 INFO L124 PetriNetUnfolderBase]: 32/113 cut-off events. [2025-02-08 08:34:33,659 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-08 08:34:33,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 113 events. 32/113 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 333 event pairs, 5 based on Foata normal form. 4/115 useless extension candidates. Maximal degree in co-relation 223. Up to 38 conditions per place. [2025-02-08 08:34:33,659 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 30 selfloop transitions, 1 changer transitions 12/46 dead transitions. [2025-02-08 08:34:33,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 261 flow [2025-02-08 08:34:33,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:34:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:34:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-02-08 08:34:33,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2025-02-08 08:34:33,660 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 135 flow. Second operand 4 states and 107 transitions. [2025-02-08 08:34:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 261 flow [2025-02-08 08:34:33,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:34:33,661 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 135 flow [2025-02-08 08:34:33,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-02-08 08:34:33,662 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-02-08 08:34:33,662 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 135 flow [2025-02-08 08:34:33,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:34:33,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:33,662 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:33,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:34:33,662 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:34:33,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2136916563, now seen corresponding path program 4 times [2025-02-08 08:34:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605212234] [2025-02-08 08:34:33,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:34:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:33,674 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:34:33,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:34:33,682 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:34:33,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:33,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605212234] [2025-02-08 08:34:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605212234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:33,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:33,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:34:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843386535] [2025-02-08 08:34:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:33,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:33,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:33,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:33,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-08 08:34:33,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:33,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:33,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-08 08:34:33,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:33,823 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-02-08 08:34:33,823 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-08 08:34:33,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 62 events. 12/62 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs, 6 based on Foata normal form. 4/64 useless extension candidates. Maximal degree in co-relation 175. Up to 32 conditions per place. [2025-02-08 08:34:33,824 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 0 selfloop transitions, 0 changer transitions 34/34 dead transitions. [2025-02-08 08:34:33,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 209 flow [2025-02-08 08:34:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:34:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:34:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-02-08 08:34:33,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6011904761904762 [2025-02-08 08:34:33,824 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 135 flow. Second operand 4 states and 101 transitions. [2025-02-08 08:34:33,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 209 flow [2025-02-08 08:34:33,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 202 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 08:34:33,826 INFO L231 Difference]: Finished difference. Result has 41 places, 0 transitions, 0 flow [2025-02-08 08:34:33,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=41, PETRI_TRANSITIONS=0} [2025-02-08 08:34:33,826 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2025-02-08 08:34:33,826 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 0 transitions, 0 flow [2025-02-08 08:34:33,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2025-02-08 08:34:33,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (11 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (10 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 24 remaining) [2025-02-08 08:34:33,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2025-02-08 08:34:33,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 24 remaining) [2025-02-08 08:34:33,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:34:33,831 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:33,834 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:34:33,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:34:33,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:34:33 BasicIcfg [2025-02-08 08:34:33,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:34:33,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:34:33,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:34:33,839 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:34:33,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:34:23" (3/4) ... [2025-02-08 08:34:33,840 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:34:33,841 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:34:33,842 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:34:33,845 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2025-02-08 08:34:33,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2025-02-08 08:34:33,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 08:34:33,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:34:33,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:34:33,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:34:33,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:34:33,906 INFO L158 Benchmark]: Toolchain (without parser) took 11014.95ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.7MB in the beginning and 120.1MB in the end (delta: 35.6MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2025-02-08 08:34:33,906 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:34:33,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.01ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 143.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:34:33,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.35ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:34:33,907 INFO L158 Benchmark]: Boogie Preprocessor took 38.19ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:34:33,907 INFO L158 Benchmark]: IcfgBuilder took 593.94ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 82.7MB in the end (delta: 56.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 08:34:33,907 INFO L158 Benchmark]: TraceAbstraction took 10070.20ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 82.3MB in the beginning and 128.4MB in the end (delta: -46.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:34:33,908 INFO L158 Benchmark]: Witness Printer took 66.77ms. Allocated memory is still 243.3MB. Free memory was 128.4MB in the beginning and 120.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:34:33,909 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.17ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.01ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 143.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.35ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.19ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 593.94ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 82.7MB in the end (delta: 56.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10070.20ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 82.3MB in the beginning and 128.4MB in the end (delta: -46.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 66.77ms. Allocated memory is still 243.3MB. Free memory was 128.4MB in the beginning and 120.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 76]: 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, 63 locations, 24 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: 10.0s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1534 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1286 mSDsluCounter, 770 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 737 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4529 IncrementalHoareTripleChecker+Invalid, 4654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 33 mSDtfsCounter, 4529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=4, InterpolantAutomatonStates: 83, 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.3s InterpolantComputationTime, 491 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 607 ConstructedInterpolants, 34 QuantifiedInterpolants, 5318 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1412 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 29 InterpolantComputations, 10 PerfectInterpolantSequences, 848/990 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:34:33,922 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