./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-memsafety/list1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/pthread-memsafety/list1.i -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 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:14:20,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:14:20,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:14:20,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:14:20,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:14:20,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:14:20,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:14:20,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:14:20,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:14:20,812 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:14:20,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:14:20,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:14:20,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:14:20,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:14:20,812 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:14:20,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:14:20,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:14:20,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:14:20,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:14:20,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:14:20,815 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:14:20,815 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:14:20,815 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:14:20,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:14:20,815 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:14:20,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:14:20,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:14:20,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:14:20,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:14:20,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:14:20,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:14:20,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:14:20,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:20,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:14:20,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:14:20,817 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2025-02-06 13:14:21,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:14:21,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:14:21,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:14:21,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:14:21,115 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:14:21,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2025-02-06 13:14:22,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9bbc65e6/cd11499cc3c34efbbf93f811dcd463a0/FLAGb74acff2b [2025-02-06 13:14:22,873 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:14:22,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2025-02-06 13:14:22,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9bbc65e6/cd11499cc3c34efbbf93f811dcd463a0/FLAGb74acff2b [2025-02-06 13:14:22,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9bbc65e6/cd11499cc3c34efbbf93f811dcd463a0 [2025-02-06 13:14:22,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:14:22,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:14:22,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:22,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:14:22,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:14:22,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:22" (1/1) ... [2025-02-06 13:14:22,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b89e418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:22, skipping insertion in model container [2025-02-06 13:14:22,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:22" (1/1) ... [2025-02-06 13:14:22,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:14:23,261 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-06 13:14:23,266 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-06 13:14:23,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:23,287 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:14:23,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:23,386 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:14:23,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23 WrapperNode [2025-02-06 13:14:23,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:23,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:23,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:14:23,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:14:23,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,420 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-02-06 13:14:23,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:23,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:14:23,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:14:23,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:14:23,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,445 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [3, 8]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 3 writes are split as follows [1, 2]. [2025-02-06 13:14:23,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:14:23,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:14:23,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:14:23,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:14:23,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (1/1) ... [2025-02-06 13:14:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:23,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:23,486 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-06 13:14:23,489 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-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2025-02-06 13:14:23,510 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure build [2025-02-06 13:14:23,510 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2025-02-06 13:14:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:14:23,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:14:23,511 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:14:23,638 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:14:23,640 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:14:23,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc ~#list~0#1.base, ~#list~0#1.offset; [2025-02-06 13:14:23,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: SUMMARY for call ULTIMATE.dealloc(~#list~0#1.base, ~#list~0#1.offset); srcloc: null [2025-02-06 13:14:23,936 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:14:23,936 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:14:24,034 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:14:24,034 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:14:24,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:24 BoogieIcfgContainer [2025-02-06 13:14:24,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:14:24,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:14:24,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:14:24,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:14:24,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:14:22" (1/3) ... [2025-02-06 13:14:24,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708dd69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:24, skipping insertion in model container [2025-02-06 13:14:24,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:23" (2/3) ... [2025-02-06 13:14:24,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708dd69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:24, skipping insertion in model container [2025-02-06 13:14:24,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:24" (3/3) ... [2025-02-06 13:14:24,046 INFO L128 eAbstractionObserver]: Analyzing ICFG list1.i [2025-02-06 13:14:24,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:14:24,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list1.i that has 3 procedures, 70 locations, 1 initial locations, 2 loop locations, and 30 error locations. [2025-02-06 13:14:24,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:14:24,151 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:14:24,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2025-02-06 13:14:24,234 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2025-02-06 13:14:24,237 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:24,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 216 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2025-02-06 13:14:24,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2025-02-06 13:14:24,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2025-02-06 13:14:24,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:24,265 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;@2799d84a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:24,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 13:14:24,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:24,270 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 13:14:24,270 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:14:24,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:24,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:14:24,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:24,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash 265879768, now seen corresponding path program 1 times [2025-02-06 13:14:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:24,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82473131] [2025-02-06 13:14:24,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:24,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:24,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:14:24,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:14:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:24,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:24,606 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-06 13:14:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82473131] [2025-02-06 13:14:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82473131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842090305] [2025-02-06 13:14:24,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:24,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:24,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:24,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:24,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-02-06 13:14:24,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-06 13:14:24,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:24,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-02-06 13:14:24,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:24,903 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2025-02-06 13:14:24,903 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:14:24,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 512 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2025-02-06 13:14:24,906 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-02-06 13:14:24,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2025-02-06 13:14:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-02-06 13:14:24,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-02-06 13:14:24,919 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2025-02-06 13:14:24,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2025-02-06 13:14:24,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:24,930 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2025-02-06 13:14:24,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-02-06 13:14:24,937 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-02-06 13:14:24,938 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2025-02-06 13:14:24,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-06 13:14:24,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:24,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:14:24,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:14:24,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:24,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 265879769, now seen corresponding path program 1 times [2025-02-06 13:14:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:24,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933607109] [2025-02-06 13:14:24,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:24,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:14:24,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:14:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:24,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:25,158 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-06 13:14:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933607109] [2025-02-06 13:14:25,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933607109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:25,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:25,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949435896] [2025-02-06 13:14:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:25,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:25,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:25,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:25,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2025-02-06 13:14:25,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-06 13:14:25,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:25,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2025-02-06 13:14:25,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:25,373 INFO L124 PetriNetUnfolderBase]: 24/130 cut-off events. [2025-02-06 13:14:25,373 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 13:14:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 130 events. 24/130 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 410 event pairs, 8 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 63. Up to 48 conditions per place. [2025-02-06 13:14:25,375 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-02-06 13:14:25,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 215 flow [2025-02-06 13:14:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-02-06 13:14:25,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.706081081081081 [2025-02-06 13:14:25,378 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 209 transitions. [2025-02-06 13:14:25,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 215 flow [2025-02-06 13:14:25,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:25,380 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 156 flow [2025-02-06 13:14:25,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-02-06 13:14:25,382 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-02-06 13:14:25,382 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 156 flow [2025-02-06 13:14:25,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-06 13:14:25,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:25,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:14:25,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:14:25,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:25,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash -347661543, now seen corresponding path program 1 times [2025-02-06 13:14:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:25,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93297666] [2025-02-06 13:14:25,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:25,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:14:25,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:14:25,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:25,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:25,525 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-06 13:14:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93297666] [2025-02-06 13:14:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93297666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106076071] [2025-02-06 13:14:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:25,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:25,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:25,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:25,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2025-02-06 13:14:25,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-06 13:14:25,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:25,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2025-02-06 13:14:25,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:25,653 INFO L124 PetriNetUnfolderBase]: 26/124 cut-off events. [2025-02-06 13:14:25,653 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 13:14:25,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 124 events. 26/124 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 358 event pairs, 12 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2025-02-06 13:14:25,654 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-02-06 13:14:25,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 208 flow [2025-02-06 13:14:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-02-06 13:14:25,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-02-06 13:14:25,657 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 156 flow. Second operand 3 states and 155 transitions. [2025-02-06 13:14:25,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 208 flow [2025-02-06 13:14:25,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:25,658 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 146 flow [2025-02-06 13:14:25,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-02-06 13:14:25,659 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2025-02-06 13:14:25,661 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 146 flow [2025-02-06 13:14:25,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-06 13:14:25,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:25,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:14:25,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:14:25,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash -347661542, now seen corresponding path program 1 times [2025-02-06 13:14:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:25,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681545991] [2025-02-06 13:14:25,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:25,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:14:25,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:14:25,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:25,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:25,738 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-06 13:14:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681545991] [2025-02-06 13:14:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681545991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:25,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743106773] [2025-02-06 13:14:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:25,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:25,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:25,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:25,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2025-02-06 13:14:25,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-06 13:14:25,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:25,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2025-02-06 13:14:25,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:25,838 INFO L124 PetriNetUnfolderBase]: 24/114 cut-off events. [2025-02-06 13:14:25,839 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 13:14:25,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 114 events. 24/114 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 12 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2025-02-06 13:14:25,839 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-02-06 13:14:25,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 194 flow [2025-02-06 13:14:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-02-06 13:14:25,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-02-06 13:14:25,841 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 146 flow. Second operand 3 states and 159 transitions. [2025-02-06 13:14:25,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 194 flow [2025-02-06 13:14:25,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:25,842 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2025-02-06 13:14:25,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2025-02-06 13:14:25,843 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2025-02-06 13:14:25,843 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2025-02-06 13:14:25,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-06 13:14:25,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:25,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:25,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:14:25,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:25,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1849642564, now seen corresponding path program 1 times [2025-02-06 13:14:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:25,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444196461] [2025-02-06 13:14:25,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:25,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:14:25,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:14:25,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:26,107 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-06 13:14:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444196461] [2025-02-06 13:14:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444196461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:26,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:26,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 13:14:26,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936189595] [2025-02-06 13:14:26,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:26,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:14:26,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:26,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:14:26,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:14:26,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-02-06 13:14:26,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-06 13:14:26,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:26,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-02-06 13:14:26,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:26,574 INFO L124 PetriNetUnfolderBase]: 35/141 cut-off events. [2025-02-06 13:14:26,575 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-06 13:14:26,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 35/141 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 406 event pairs, 19 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 132. Up to 73 conditions per place. [2025-02-06 13:14:26,576 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 32 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2025-02-06 13:14:26,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 260 flow [2025-02-06 13:14:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:14:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:14:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2025-02-06 13:14:26,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2025-02-06 13:14:26,579 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 10 states and 483 transitions. [2025-02-06 13:14:26,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 260 flow [2025-02-06 13:14:26,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:26,582 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 209 flow [2025-02-06 13:14:26,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=209, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2025-02-06 13:14:26,582 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2025-02-06 13:14:26,582 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 209 flow [2025-02-06 13:14:26,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-06 13:14:26,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:26,583 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:26,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:14:26,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:26,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048806, now seen corresponding path program 1 times [2025-02-06 13:14:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691342245] [2025-02-06 13:14:26,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:26,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:14:26,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:14:26,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:26,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:27,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:27,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691342245] [2025-02-06 13:14:27,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691342245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:14:27,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184816214] [2025-02-06 13:14:27,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:27,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:27,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:27,044 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-06 13:14:27,046 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-06 13:14:27,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:14:27,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:14:27,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:27,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:27,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 13:14:27,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:27,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-02-06 13:14:27,263 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-06 13:14:27,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-02-06 13:14:27,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2025-02-06 13:14:27,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:14:27,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2025-02-06 13:14:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:27,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:14:27,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 34 [2025-02-06 13:14:27,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:14:27,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2025-02-06 13:14:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:28,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184816214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:14:28,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:14:28,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-06 13:14:28,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871194906] [2025-02-06 13:14:28,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:14:28,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:14:28,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:28,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:14:28,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:14:29,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2025-02-06 13:14:29,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 209 flow. Second operand has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 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-06 13:14:29,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:29,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2025-02-06 13:14:29,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:29,785 INFO L124 PetriNetUnfolderBase]: 35/152 cut-off events. [2025-02-06 13:14:29,785 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-06 13:14:29,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 152 events. 35/152 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 469 event pairs, 5 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 160. Up to 31 conditions per place. [2025-02-06 13:14:29,787 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2025-02-06 13:14:29,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 322 flow [2025-02-06 13:14:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:14:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:14:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 360 transitions. [2025-02-06 13:14:29,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-02-06 13:14:29,789 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 209 flow. Second operand 8 states and 360 transitions. [2025-02-06 13:14:29,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 322 flow [2025-02-06 13:14:29,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:29,792 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 224 flow [2025-02-06 13:14:29,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-02-06 13:14:29,792 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-02-06 13:14:29,793 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 224 flow [2025-02-06 13:14:29,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 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-06 13:14:29,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:29,793 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:29,801 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-06 13:14:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:29,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:29,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048805, now seen corresponding path program 1 times [2025-02-06 13:14:29,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247394958] [2025-02-06 13:14:29,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:30,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:14:30,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:14:30,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:30,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247394958] [2025-02-06 13:14:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247394958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:14:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490638593] [2025-02-06 13:14:30,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:30,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:30,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:30,503 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-06 13:14:30,505 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-06 13:14:30,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:14:30,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:14:30,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:30,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:30,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-06 13:14:30,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:30,616 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-06 13:14:30,619 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-06 13:14:30,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:14:30,675 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-06 13:14:30,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:14:30,685 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-06 13:14:30,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-02-06 13:14:30,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-02-06 13:14:30,772 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 13:14:30,773 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 18 treesize of output 21 [2025-02-06 13:14:30,792 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 13:14:30,793 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 15 treesize of output 15 [2025-02-06 13:14:30,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2025-02-06 13:14:30,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:14:30,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-02-06 13:14:30,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2025-02-06 13:14:30,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-06 13:14:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:30,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:14:31,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 28 [2025-02-06 13:14:31,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 66 treesize of output 62 [2025-02-06 13:14:31,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 102 treesize of output 94 [2025-02-06 13:14:31,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:14:31,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2025-02-06 13:14:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:31,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490638593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:14:31,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:14:31,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-06 13:14:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547765318] [2025-02-06 13:14:31,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:14:31,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 13:14:31,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:31,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 13:14:31,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-06 13:14:32,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-02-06 13:14:32,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 224 flow. Second operand has 20 states, 20 states have (on average 37.1) internal successors, (742), 20 states have internal predecessors, (742), 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-06 13:14:32,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:32,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-02-06 13:14:32,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:33,368 INFO L124 PetriNetUnfolderBase]: 35/150 cut-off events. [2025-02-06 13:14:33,369 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 13:14:33,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 150 events. 35/150 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 446 event pairs, 5 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 169. Up to 31 conditions per place. [2025-02-06 13:14:33,370 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2025-02-06 13:14:33,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 337 flow [2025-02-06 13:14:33,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:14:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:14:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2025-02-06 13:14:33,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2025-02-06 13:14:33,371 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 224 flow. Second operand 8 states and 328 transitions. [2025-02-06 13:14:33,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 337 flow [2025-02-06 13:14:33,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 303 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-06 13:14:33,374 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 208 flow [2025-02-06 13:14:33,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-02-06 13:14:33,374 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-02-06 13:14:33,374 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 208 flow [2025-02-06 13:14:33,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 37.1) internal successors, (742), 20 states have internal predecessors, (742), 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-06 13:14:33,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:33,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:33,384 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-06 13:14:33,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:33,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:33,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash -609587531, now seen corresponding path program 1 times [2025-02-06 13:14:33,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320301456] [2025-02-06 13:14:33,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:33,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:33,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:14:33,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:14:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:33,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:33,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320301456] [2025-02-06 13:14:33,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320301456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:33,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:33,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:14:33,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713437614] [2025-02-06 13:14:33,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:33,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:33,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:33,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:33,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:33,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2025-02-06 13:14:33,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-06 13:14:33,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:33,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2025-02-06 13:14:33,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:33,795 INFO L124 PetriNetUnfolderBase]: 21/77 cut-off events. [2025-02-06 13:14:33,795 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 13:14:33,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 77 events. 21/77 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 69. Up to 51 conditions per place. [2025-02-06 13:14:33,796 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-02-06 13:14:33,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 196 flow [2025-02-06 13:14:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-02-06 13:14:33,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2025-02-06 13:14:33,799 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 208 flow. Second operand 5 states and 224 transitions. [2025-02-06 13:14:33,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 196 flow [2025-02-06 13:14:33,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 175 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 13:14:33,800 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 123 flow [2025-02-06 13:14:33,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-02-06 13:14:33,801 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -28 predicate places. [2025-02-06 13:14:33,801 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 123 flow [2025-02-06 13:14:33,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-06 13:14:33,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:33,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:14:33,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:33,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1638560624, now seen corresponding path program 1 times [2025-02-06 13:14:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972952329] [2025-02-06 13:14:33,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:33,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:14:33,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:14:33,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:33,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:33,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:14:33,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:14:33,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:14:33,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:33,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:33,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:14:33,859 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:14:33,860 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-02-06 13:14:33,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2025-02-06 13:14:33,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (37 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-02-06 13:14:33,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2025-02-06 13:14:33,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2025-02-06 13:14:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:14:33,868 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:33,909 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:14:33,909 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:14:33,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:14:33 BasicIcfg [2025-02-06 13:14:33,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:14:33,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:14:33,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:14:33,915 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:14:33,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:24" (3/4) ... [2025-02-06 13:14:33,918 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:14:33,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:14:33,920 INFO L158 Benchmark]: Toolchain (without parser) took 10995.52ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 111.0MB in the beginning and 156.6MB in the end (delta: -45.6MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-02-06 13:14:33,920 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:33,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.81ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 84.3MB in the end (delta: 26.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:14:33,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.05ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:14:33,920 INFO L158 Benchmark]: Boogie Preprocessor took 36.30ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:33,921 INFO L158 Benchmark]: IcfgBuilder took 576.42ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 53.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 13:14:33,921 INFO L158 Benchmark]: TraceAbstraction took 9877.73ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 53.1MB in the beginning and 156.6MB in the end (delta: -103.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:33,922 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 218.1MB. Free memory was 156.6MB in the beginning and 156.6MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:33,923 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.35ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.81ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 84.3MB in the end (delta: 26.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.05ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.30ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 576.42ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 53.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9877.73ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 53.1MB in the beginning and 156.6MB in the end (delta: -103.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 218.1MB. Free memory was 156.6MB in the beginning and 156.6MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1051] COND TRUE 1 __VERIFIER_nondet_int() [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={2:0}, elem={-1:0}, plist={2:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, argc=9, id1=-1, id2=0, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 61 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: 9.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1423 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1141 mSDsluCounter, 1401 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1354 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5144 IncrementalHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 47 mSDtfsCounter, 5144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 10 QuantifiedInterpolants, 1815 SizeOfPredicates, 37 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 7/31 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 13:14:33,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/pthread-memsafety/list1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:14:36,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:14:36,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 13:14:36,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:14:36,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:14:36,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:14:36,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:14:36,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:14:36,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:14:36,283 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:14:36,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:14:36,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:14:36,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:14:36,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:14:36,284 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:14:36,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:14:36,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:14:36,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:14:36,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:14:36,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:14:36,285 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:14:36,285 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:14:36,285 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:14:36,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:14:36,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:14:36,286 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 13:14:36,286 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 13:14:36,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:14:36,286 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:14:36,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:14:36,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:14:36,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:36,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 13:14:36,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:14:36,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:14:36,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:14:36,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:14:36,288 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2025-02-06 13:14:36,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:14:36,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:14:36,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:14:36,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:14:36,557 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:14:36,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2025-02-06 13:14:37,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d4c63f30/adff01d1a21f4e77b633d6682c172993/FLAG08cd1f48f [2025-02-06 13:14:38,302 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:14:38,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2025-02-06 13:14:38,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d4c63f30/adff01d1a21f4e77b633d6682c172993/FLAG08cd1f48f [2025-02-06 13:14:38,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d4c63f30/adff01d1a21f4e77b633d6682c172993 [2025-02-06 13:14:38,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:14:38,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:14:38,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:38,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:14:38,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:14:38,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:38" (1/1) ... [2025-02-06 13:14:38,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2578f1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:38, skipping insertion in model container [2025-02-06 13:14:38,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:38" (1/1) ... [2025-02-06 13:14:38,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:14:38,873 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-06 13:14:38,878 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-06 13:14:38,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:38,895 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:14:38,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:39,008 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:14:39,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39 WrapperNode [2025-02-06 13:14:39,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:39,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:39,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:14:39,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:14:39,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,065 INFO L138 Inliner]: procedures = 265, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-02-06 13:14:39,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:39,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:14:39,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:14:39,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:14:39,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,099 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [8, 3]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 3 writes are split as follows [2, 1]. [2025-02-06 13:14:39,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:14:39,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:14:39,121 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:14:39,121 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:14:39,122 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:39,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:39,154 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-06 13:14:39,158 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-06 13:14:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:14:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 13:14:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 13:14:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:14:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:14:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:14:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:14:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 13:14:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 13:14:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2025-02-06 13:14:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2025-02-06 13:14:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure build [2025-02-06 13:14:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2025-02-06 13:14:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:14:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:14:39,184 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:14:39,314 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:14:39,315 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:14:39,494 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc ~#list~0#1.base, ~#list~0#1.offset; [2025-02-06 13:14:39,494 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: SUMMARY for call ULTIMATE.dealloc(~#list~0#1.base, ~#list~0#1.offset); srcloc: null [2025-02-06 13:14:39,605 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:14:39,605 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:14:39,701 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:14:39,702 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:14:39,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:39 BoogieIcfgContainer [2025-02-06 13:14:39,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:14:39,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:14:39,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:14:39,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:14:39,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:14:38" (1/3) ... [2025-02-06 13:14:39,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6ed0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:39, skipping insertion in model container [2025-02-06 13:14:39,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (2/3) ... [2025-02-06 13:14:39,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6ed0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:39, skipping insertion in model container [2025-02-06 13:14:39,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:39" (3/3) ... [2025-02-06 13:14:39,713 INFO L128 eAbstractionObserver]: Analyzing ICFG list1.i [2025-02-06 13:14:39,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:14:39,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list1.i that has 3 procedures, 70 locations, 1 initial locations, 2 loop locations, and 30 error locations. [2025-02-06 13:14:39,729 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:14:39,817 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:14:39,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2025-02-06 13:14:39,893 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2025-02-06 13:14:39,895 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:39,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 216 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2025-02-06 13:14:39,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2025-02-06 13:14:39,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2025-02-06 13:14:39,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:39,916 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;@6095dc75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:39,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 13:14:39,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:39,923 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 13:14:39,923 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:14:39,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:39,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:14:39,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:39,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 265879768, now seen corresponding path program 1 times [2025-02-06 13:14:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088643987] [2025-02-06 13:14:39,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:39,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:39,942 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-06 13:14:39,943 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-06 13:14:40,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:14:40,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:14:40,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:40,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:40,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:14:40,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:40,106 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 7 [2025-02-06 13:14:40,172 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-02-06 13:14:40,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 13:14:40,222 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-06 13:14:40,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:40,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088643987] [2025-02-06 13:14:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088643987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:40,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:40,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932612576] [2025-02-06 13:14:40,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:40,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:40,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:40,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:40,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-02-06 13:14:40,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-06 13:14:40,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:40,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-02-06 13:14:40,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:40,536 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2025-02-06 13:14:40,536 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:14:40,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 512 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2025-02-06 13:14:40,538 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-02-06 13:14:40,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2025-02-06 13:14:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-02-06 13:14:40,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-02-06 13:14:40,551 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2025-02-06 13:14:40,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2025-02-06 13:14:40,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:40,558 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2025-02-06 13:14:40,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-02-06 13:14:40,564 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-02-06 13:14:40,564 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2025-02-06 13:14:40,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-06 13:14:40,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:40,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:14:40,573 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-06 13:14:40,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:40,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:40,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 265879769, now seen corresponding path program 1 times [2025-02-06 13:14:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732099118] [2025-02-06 13:14:40,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:40,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:40,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:40,772 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-06 13:14:40,773 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-06 13:14:40,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:14:40,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:14:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:40,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:14:40,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:40,880 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 7 [2025-02-06 13:14:40,890 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-06 13:14:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:14:40,950 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-06 13:14:40,968 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 13:14:40,968 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 13 treesize of output 13 [2025-02-06 13:14:40,984 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-06 13:14:40,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:40,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:40,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732099118] [2025-02-06 13:14:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732099118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:40,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:40,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219078490] [2025-02-06 13:14:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:40,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:40,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:40,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:40,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:41,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2025-02-06 13:14:41,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-06 13:14:41,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:41,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2025-02-06 13:14:41,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:41,322 INFO L124 PetriNetUnfolderBase]: 27/156 cut-off events. [2025-02-06 13:14:41,322 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 13:14:41,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 156 events. 27/156 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 560 event pairs, 4 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 63. Up to 42 conditions per place. [2025-02-06 13:14:41,323 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 29 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-02-06 13:14:41,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 247 flow [2025-02-06 13:14:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-02-06 13:14:41,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7331081081081081 [2025-02-06 13:14:41,325 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 217 transitions. [2025-02-06 13:14:41,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 247 flow [2025-02-06 13:14:41,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:41,327 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 175 flow [2025-02-06 13:14:41,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2025-02-06 13:14:41,328 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2025-02-06 13:14:41,328 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 175 flow [2025-02-06 13:14:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-06 13:14:41,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:41,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:14:41,337 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-06 13:14:41,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:41,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:41,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -347661543, now seen corresponding path program 1 times [2025-02-06 13:14:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:41,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940947523] [2025-02-06 13:14:41,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:41,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:41,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:41,532 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-06 13:14:41,533 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-06 13:14:41,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:14:41,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:14:41,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:41,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:41,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:14:41,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:41,613 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 7 [2025-02-06 13:14:41,623 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-06 13:14:41,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:41,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940947523] [2025-02-06 13:14:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940947523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:41,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:41,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477255172] [2025-02-06 13:14:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:41,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:41,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:41,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:41,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2025-02-06 13:14:41,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-06 13:14:41,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:41,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2025-02-06 13:14:41,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:41,786 INFO L124 PetriNetUnfolderBase]: 28/134 cut-off events. [2025-02-06 13:14:41,787 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 13:14:41,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 134 events. 28/134 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 413 event pairs, 12 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 122. Up to 54 conditions per place. [2025-02-06 13:14:41,789 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-02-06 13:14:41,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 229 flow [2025-02-06 13:14:41,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-02-06 13:14:41,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-02-06 13:14:41,792 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 175 flow. Second operand 3 states and 155 transitions. [2025-02-06 13:14:41,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 229 flow [2025-02-06 13:14:41,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:41,794 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 164 flow [2025-02-06 13:14:41,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-02-06 13:14:41,797 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2025-02-06 13:14:41,797 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 164 flow [2025-02-06 13:14:41,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-06 13:14:41,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:41,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:14:41,806 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-06 13:14:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:41,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash -347661542, now seen corresponding path program 1 times [2025-02-06 13:14:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143393564] [2025-02-06 13:14:41,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:42,003 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-06 13:14:42,004 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-06 13:14:42,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:14:42,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:14:42,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:42,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:42,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:14:42,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:42,083 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-06 13:14:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:42,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:42,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143393564] [2025-02-06 13:14:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143393564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:42,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:42,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615225489] [2025-02-06 13:14:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:42,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:42,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:42,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:42,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2025-02-06 13:14:42,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-06 13:14:42,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:42,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2025-02-06 13:14:42,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:42,247 INFO L124 PetriNetUnfolderBase]: 26/122 cut-off events. [2025-02-06 13:14:42,247 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 13:14:42,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 122 events. 26/122 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 350 event pairs, 12 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 118. Up to 54 conditions per place. [2025-02-06 13:14:42,248 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-02-06 13:14:42,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 214 flow [2025-02-06 13:14:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-02-06 13:14:42,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-02-06 13:14:42,250 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 164 flow. Second operand 3 states and 159 transitions. [2025-02-06 13:14:42,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 214 flow [2025-02-06 13:14:42,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:42,253 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 156 flow [2025-02-06 13:14:42,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2025-02-06 13:14:42,254 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2025-02-06 13:14:42,254 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 156 flow [2025-02-06 13:14:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-06 13:14:42,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:42,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:42,264 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-06 13:14:42,460 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 [2025-02-06 13:14:42,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:42,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:42,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1849642564, now seen corresponding path program 1 times [2025-02-06 13:14:42,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:42,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362250496] [2025-02-06 13:14:42,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:42,463 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-06 13:14:42,465 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-06 13:14:42,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:14:42,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:14:42,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:42,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:42,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 13:14:42,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:42,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-02-06 13:14:42,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-02-06 13:14:42,705 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-06 13:14:42,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:42,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:42,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362250496] [2025-02-06 13:14:42,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362250496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:42,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:42,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 13:14:42,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860166229] [2025-02-06 13:14:42,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:42,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:14:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:42,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:14:42,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:14:42,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-02-06 13:14:42,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-06 13:14:42,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:42,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-02-06 13:14:42,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:43,429 INFO L124 PetriNetUnfolderBase]: 36/148 cut-off events. [2025-02-06 13:14:43,429 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-06 13:14:43,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 148 events. 36/148 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 451 event pairs, 20 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 118. Up to 76 conditions per place. [2025-02-06 13:14:43,430 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 33 selfloop transitions, 11 changer transitions 0/75 dead transitions. [2025-02-06 13:14:43,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 286 flow [2025-02-06 13:14:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:14:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:14:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2025-02-06 13:14:43,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2025-02-06 13:14:43,432 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 156 flow. Second operand 10 states and 483 transitions. [2025-02-06 13:14:43,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 286 flow [2025-02-06 13:14:43,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:43,434 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 231 flow [2025-02-06 13:14:43,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-02-06 13:14:43,435 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-02-06 13:14:43,435 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 231 flow [2025-02-06 13:14:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-06 13:14:43,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:43,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:43,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:14:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:43,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1849643684, now seen corresponding path program 1 times [2025-02-06 13:14:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452137148] [2025-02-06 13:14:43,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:43,644 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-06 13:14:43,645 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-06 13:14:43,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:14:43,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:14:43,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:43,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:14:43,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:43,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:14:43,790 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-06 13:14:43,799 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 13:14:43,800 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 13 treesize of output 13 [2025-02-06 13:14:43,821 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-06 13:14:43,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:43,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:43,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452137148] [2025-02-06 13:14:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452137148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:43,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:14:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56369670] [2025-02-06 13:14:43,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:43,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:14:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:43,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:14:43,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:14:43,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2025-02-06 13:14:43,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-06 13:14:43,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:43,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2025-02-06 13:14:43,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:44,065 INFO L124 PetriNetUnfolderBase]: 33/141 cut-off events. [2025-02-06 13:14:44,065 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-06 13:14:44,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 141 events. 33/141 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 418 event pairs, 8 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 150. Up to 53 conditions per place. [2025-02-06 13:14:44,066 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 30 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2025-02-06 13:14:44,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 309 flow [2025-02-06 13:14:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2025-02-06 13:14:44,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-02-06 13:14:44,070 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 231 flow. Second operand 5 states and 240 transitions. [2025-02-06 13:14:44,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 309 flow [2025-02-06 13:14:44,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:44,072 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 240 flow [2025-02-06 13:14:44,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2025-02-06 13:14:44,075 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-02-06 13:14:44,075 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 240 flow [2025-02-06 13:14:44,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-06 13:14:44,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:44,076 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:44,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:14:44,276 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 [2025-02-06 13:14:44,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:44,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048806, now seen corresponding path program 1 times [2025-02-06 13:14:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545632149] [2025-02-06 13:14:44,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:44,282 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-06 13:14:44,283 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-06 13:14:44,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:14:44,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:14:44,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:44,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:44,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:14:44,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:44,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-02-06 13:14:44,504 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2025-02-06 13:14:44,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2025-02-06 13:14:44,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-02-06 13:14:44,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:14:44,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-02-06 13:14:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:44,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:14:44,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-02-06 13:14:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:44,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:44,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545632149] [2025-02-06 13:14:44,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545632149] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:14:44,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:14:44,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-02-06 13:14:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129370282] [2025-02-06 13:14:44,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:14:44,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:14:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:44,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:14:44,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:14:48,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:14:49,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 74 [2025-02-06 13:14:49,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 240 flow. Second operand has 13 states, 13 states have (on average 31.846153846153847) internal successors, (414), 13 states have internal predecessors, (414), 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-06 13:14:49,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:49,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 74 [2025-02-06 13:14:49,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:50,010 INFO L124 PetriNetUnfolderBase]: 44/168 cut-off events. [2025-02-06 13:14:50,010 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-06 13:14:50,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 168 events. 44/168 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 543 event pairs, 10 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 207. Up to 49 conditions per place. [2025-02-06 13:14:50,013 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 47 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2025-02-06 13:14:50,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 381 flow [2025-02-06 13:14:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:14:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:14:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 298 transitions. [2025-02-06 13:14:50,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2025-02-06 13:14:50,015 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 240 flow. Second operand 8 states and 298 transitions. [2025-02-06 13:14:50,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 381 flow [2025-02-06 13:14:50,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 80 transitions, 365 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:50,020 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 244 flow [2025-02-06 13:14:50,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2025-02-06 13:14:50,022 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2025-02-06 13:14:50,023 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 244 flow [2025-02-06 13:14:50,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 31.846153846153847) internal successors, (414), 13 states have internal predecessors, (414), 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-06 13:14:50,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:50,024 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:50,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:14:50,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:50,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:14:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048805, now seen corresponding path program 1 times [2025-02-06 13:14:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300799713] [2025-02-06 13:14:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:50,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:50,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:14:50,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:14:50,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:14:50,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:50,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:50,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 13:14:50,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:50,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-02-06 13:14:50,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-02-06 13:14:50,501 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-02-06 13:14:50,501 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 17 treesize of output 17 [2025-02-06 13:14:50,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 13:14:50,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2025-02-06 13:14:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-02-06 13:14:50,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:14:50,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2025-02-06 13:14:50,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-06 13:14:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:14:50,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:14:51,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 32 [2025-02-06 13:14:51,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 66 treesize of output 62 [2025-02-06 13:14:51,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 102 treesize of output 94 [2025-02-06 13:14:52,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:14:52,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 405 treesize of output 599 [2025-02-06 13:14:54,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:14:54,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 328 treesize of output 758 [2025-02-06 13:15:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:15:03,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:15:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300799713] [2025-02-06 13:15:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300799713] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:03,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:15:03,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-02-06 13:15:03,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073159948] [2025-02-06 13:15:03,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:03,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:15:03,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:15:03,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:15:03,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:15:08,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:15:14,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:15:18,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:15:23,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:15:27,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:15:28,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 74 [2025-02-06 13:15:28,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 244 flow. Second operand has 16 states, 16 states have (on average 23.6875) internal successors, (379), 16 states have internal predecessors, (379), 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-06 13:15:28,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:28,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 74 [2025-02-06 13:15:28,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:29,853 INFO L124 PetriNetUnfolderBase]: 46/171 cut-off events. [2025-02-06 13:15:29,853 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-02-06 13:15:29,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 171 events. 46/171 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 554 event pairs, 13 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 228. Up to 57 conditions per place. [2025-02-06 13:15:29,855 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 47 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2025-02-06 13:15:29,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 385 flow [2025-02-06 13:15:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:15:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:15:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 234 transitions. [2025-02-06 13:15:29,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952702702702703 [2025-02-06 13:15:29,859 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 244 flow. Second operand 8 states and 234 transitions. [2025-02-06 13:15:29,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 385 flow [2025-02-06 13:15:29,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 350 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-06 13:15:29,862 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 229 flow [2025-02-06 13:15:29,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-02-06 13:15:29,863 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-02-06 13:15:29,863 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 229 flow [2025-02-06 13:15:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.6875) internal successors, (379), 16 states have internal predecessors, (379), 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-06 13:15:29,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:29,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:29,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:15:30,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:30,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:15:30,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:30,069 INFO L85 PathProgramCache]: Analyzing trace with hash -447582300, now seen corresponding path program 1 times [2025-02-06 13:15:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:15:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971341496] [2025-02-06 13:15:30,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:30,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:30,071 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:30,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:15:30,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:15:30,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:15:30,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:30,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:30,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:15:30,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:30,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:15:30,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:15:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971341496] [2025-02-06 13:15:30,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971341496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:30,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:30,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:15:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991289636] [2025-02-06 13:15:30,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:15:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:15:30,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:15:30,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:15:30,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2025-02-06 13:15:30,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-06 13:15:30,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:30,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2025-02-06 13:15:30,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:30,425 INFO L124 PetriNetUnfolderBase]: 22/80 cut-off events. [2025-02-06 13:15:30,425 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-02-06 13:15:30,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 80 events. 22/80 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 15 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 80. Up to 54 conditions per place. [2025-02-06 13:15:30,426 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 26 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-02-06 13:15:30,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 37 transitions, 219 flow [2025-02-06 13:15:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:15:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:15:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-02-06 13:15:30,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2025-02-06 13:15:30,428 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 229 flow. Second operand 5 states and 224 transitions. [2025-02-06 13:15:30,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 37 transitions, 219 flow [2025-02-06 13:15:30,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 13:15:30,431 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 141 flow [2025-02-06 13:15:30,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-02-06 13:15:30,432 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -26 predicate places. [2025-02-06 13:15:30,432 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 141 flow [2025-02-06 13:15:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-06 13:15:30,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:30,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:30,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 13:15:30,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:30,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 13:15:30,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1684819294, now seen corresponding path program 1 times [2025-02-06 13:15:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:15:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016956469] [2025-02-06 13:15:30,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:30,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:30,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:30,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:30,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:15:30,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:15:30,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:15:30,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:30,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:15:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:15:30,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:15:30,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:30,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:30,831 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 13:15:30,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:15:30,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-02-06 13:15:30,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2025-02-06 13:15:30,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-02-06 13:15:30,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-02-06 13:15:30,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (37 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2025-02-06 13:15:30,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-02-06 13:15:30,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2025-02-06 13:15:30,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2025-02-06 13:15:30,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2025-02-06 13:15:30,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2025-02-06 13:15:30,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2025-02-06 13:15:30,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2025-02-06 13:15:30,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2025-02-06 13:15:30,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2025-02-06 13:15:30,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 13:15:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:31,045 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:31,093 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:15:31,093 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:15:31,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:15:31 BasicIcfg [2025-02-06 13:15:31,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:15:31,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:15:31,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:15:31,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:15:31,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:39" (3/4) ... [2025-02-06 13:15:31,107 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:15:31,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:15:31,109 INFO L158 Benchmark]: Toolchain (without parser) took 52570.16ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 90.2MB in the beginning and 104.3MB in the end (delta: -14.1MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2025-02-06 13:15:31,109 INFO L158 Benchmark]: CDTParser took 3.77ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:15:31,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.69ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 62.5MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 13:15:31,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.73ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 60.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:15:31,110 INFO L158 Benchmark]: Boogie Preprocessor took 51.24ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 58.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:15:31,110 INFO L158 Benchmark]: IcfgBuilder took 581.15ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 79.3MB in the end (delta: -21.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-02-06 13:15:31,110 INFO L158 Benchmark]: TraceAbstraction took 51397.05ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 78.5MB in the beginning and 104.3MB in the end (delta: -25.8MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2025-02-06 13:15:31,111 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 218.1MB. Free memory was 104.3MB in the beginning and 104.3MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:15:31,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.77ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.69ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 62.5MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.73ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 60.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.24ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 58.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 581.15ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 79.3MB in the end (delta: -21.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 51397.05ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 78.5MB in the beginning and 104.3MB in the end (delta: -25.8MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 218.1MB. Free memory was 104.3MB in the beginning and 104.3MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=0, \old(argv)={0:0}, argc=0, id1=-1, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={4:0}, plist={0:0}] [L1051] COND TRUE 1 __VERIFIER_nondet_int() [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={4:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={4:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={4:0}, elem={1:0}, plist={4:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=0, \old(argv)={0:0}, argc=0, id1=-1, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=0, \old(argv)={0:0}, \old(plist)={0:0}, argc=0, id1=-1, id2=0, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=0, \old(argv)={0:0}, \old(plist)={0:0}, \result={0:0}, argc=0, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=0, \old(argv)={0:0}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=0, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 61 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: 51.2s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1340 SdHoareTripleChecker+Valid, 32.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 1119 SdHoareTripleChecker+Invalid, 31.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1086 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3796 IncrementalHoareTripleChecker+Invalid, 3886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 33 mSDtfsCounter, 3796 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 122 ConstructedInterpolants, 4 QuantifiedInterpolants, 1520 SizeOfPredicates, 69 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 7/23 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 13:15:31,160 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: UNKNOWN: Overapproximated counterexample