./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:27,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:27,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:13:27,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:27,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:27,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:27,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:27,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:27,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:27,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:27,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:27,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:27,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:27,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:27,967 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:27,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:27,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:27,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:27,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:27,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:27,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:27,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:27,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:27,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:27,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:27,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:27,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:27,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:27,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:27,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:27,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:27,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:27,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:27,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:27,970 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/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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2025-03-09 01:13:28,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:28,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:28,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:28,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:28,198 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:28,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-09 01:13:29,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce97d358e/01bb2326de6a4afbbb8b9ceca040659c/FLAGbbdfdf907 [2025-03-09 01:13:29,585 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:29,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-09 01:13:29,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce97d358e/01bb2326de6a4afbbb8b9ceca040659c/FLAGbbdfdf907 [2025-03-09 01:13:29,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce97d358e/01bb2326de6a4afbbb8b9ceca040659c [2025-03-09 01:13:29,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:29,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:29,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:29,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:29,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:29,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:29,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60169643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29, skipping insertion in model container [2025-03-09 01:13:29,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:29,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:30,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:30,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:30,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:30,368 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:30,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30 WrapperNode [2025-03-09 01:13:30,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:30,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:30,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:30,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:30,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,402 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-09 01:13:30,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:30,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:30,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:30,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:30,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,422 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [5, 12]. 71 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0]. The 9 writes are split as follows [0, 9]. [2025-03-09 01:13:30,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:30,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:30,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:30,434 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:30,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (1/1) ... [2025-03-09 01:13:30,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:30,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:30,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:13:30,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:13:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:13:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:30,485 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:30,620 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:30,621 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:30,871 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:30,871 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:31,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:31,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:31,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:31 BoogieIcfgContainer [2025-03-09 01:13:31,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:31,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:31,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:31,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:31,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:29" (1/3) ... [2025-03-09 01:13:31,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d44647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:31, skipping insertion in model container [2025-03-09 01:13:31,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:30" (2/3) ... [2025-03-09 01:13:31,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d44647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:31, skipping insertion in model container [2025-03-09 01:13:31,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:31" (3/3) ... [2025-03-09 01:13:31,077 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-03-09 01:13:31,089 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:31,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 52 locations, 1 initial locations, 0 loop locations, and 25 error locations. [2025-03-09 01:13:31,090 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:31,139 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:31,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-03-09 01:13:31,194 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-09 01:13:31,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:31,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-09 01:13:31,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-03-09 01:13:31,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-03-09 01:13:31,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:31,218 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;@6ff86178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:31,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-09 01:13:31,221 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:31,221 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-09 01:13:31,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:31,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:31,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:13:31,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:31,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 11651, now seen corresponding path program 1 times [2025-03-09 01:13:31,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:31,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108594888] [2025-03-09 01:13:31,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:31,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:13:31,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:13:31,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:31,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108594888] [2025-03-09 01:13:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108594888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:31,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:31,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942170300] [2025-03-09 01:13:31,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:31,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:31,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:31,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:31,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-03-09 01:13:31,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:31,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-03-09 01:13:31,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:31,665 INFO L124 PetriNetUnfolderBase]: 42/172 cut-off events. [2025-03-09 01:13:31,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:31,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 172 events. 42/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 742 event pairs, 42 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 256. Up to 101 conditions per place. [2025-03-09 01:13:31,668 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-09 01:13:31,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-03-09 01:13:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-09 01:13:31,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-03-09 01:13:31,681 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-03-09 01:13:31,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-03-09 01:13:31,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:31,686 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-03-09 01:13:31,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-03-09 01:13:31,689 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-09 01:13:31,690 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-03-09 01:13:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:31,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:13:31,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:31,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:31,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash 11652, now seen corresponding path program 1 times [2025-03-09 01:13:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395620795] [2025-03-09 01:13:31,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:31,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:13:31,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:13:31,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:31,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:31,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:31,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395620795] [2025-03-09 01:13:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395620795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:31,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:31,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461377011] [2025-03-09 01:13:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:31,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:31,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:31,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:31,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:31,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-09 01:13:31,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:31,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-09 01:13:31,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,001 INFO L124 PetriNetUnfolderBase]: 42/168 cut-off events. [2025-03-09 01:13:32,004 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:32,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 168 events. 42/168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 733 event pairs, 42 based on Foata normal form. 3/138 useless extension candidates. Maximal degree in co-relation 264. Up to 101 conditions per place. [2025-03-09 01:13:32,005 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-09 01:13:32,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-03-09 01:13:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-09 01:13:32,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-03-09 01:13:32,007 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-03-09 01:13:32,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-03-09 01:13:32,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:32,009 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-03-09 01:13:32,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-09 01:13:32,011 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-03-09 01:13:32,011 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-03-09 01:13:32,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:32,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:13:32,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:13:32,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:32,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2115901612, now seen corresponding path program 1 times [2025-03-09 01:13:32,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:32,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581438943] [2025-03-09 01:13:32,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:32,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:32,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:13:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:13:32,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581438943] [2025-03-09 01:13:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581438943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022644756] [2025-03-09 01:13:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:32,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:32,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:32,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:32,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-03-09 01:13:32,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-03-09 01:13:32,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:32,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-03-09 01:13:32,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,285 INFO L124 PetriNetUnfolderBase]: 49/174 cut-off events. [2025-03-09 01:13:32,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:32,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 174 events. 49/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 725 event pairs, 49 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 285. Up to 115 conditions per place. [2025-03-09 01:13:32,286 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 19 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-03-09 01:13:32,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 124 flow [2025-03-09 01:13:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:13:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:13:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-03-09 01:13:32,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2025-03-09 01:13:32,288 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 4 states and 113 transitions. [2025-03-09 01:13:32,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 124 flow [2025-03-09 01:13:32,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:32,289 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 82 flow [2025-03-09 01:13:32,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-03-09 01:13:32,290 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-03-09 01:13:32,290 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 82 flow [2025-03-09 01:13:32,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-03-09 01:13:32,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:32,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:13:32,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:32,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:32,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2115901611, now seen corresponding path program 1 times [2025-03-09 01:13:32,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:32,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355509569] [2025-03-09 01:13:32,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:32,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:13:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:13:32,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:32,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:32,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355509569] [2025-03-09 01:13:32,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355509569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:32,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:32,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818045550] [2025-03-09 01:13:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:32,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:32,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:32,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:32,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-09 01:13:32,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-09 01:13:32,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:32,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-09 01:13:32,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,477 INFO L124 PetriNetUnfolderBase]: 42/144 cut-off events. [2025-03-09 01:13:32,477 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:13:32,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 144 events. 42/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 542 event pairs, 42 based on Foata normal form. 8/135 useless extension candidates. Maximal degree in co-relation 240. Up to 101 conditions per place. [2025-03-09 01:13:32,478 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 17 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-03-09 01:13:32,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 110 flow [2025-03-09 01:13:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-09 01:13:32,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-03-09 01:13:32,480 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 82 flow. Second operand 3 states and 109 transitions. [2025-03-09 01:13:32,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 110 flow [2025-03-09 01:13:32,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:32,482 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 73 flow [2025-03-09 01:13:32,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-09 01:13:32,482 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-03-09 01:13:32,483 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 73 flow [2025-03-09 01:13:32,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-09 01:13:32,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:32,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:32,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:13:32,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:32,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1884460674, now seen corresponding path program 1 times [2025-03-09 01:13:32,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:32,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541302377] [2025-03-09 01:13:32,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:32,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:32,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:32,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:32,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:32,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:32,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541302377] [2025-03-09 01:13:32,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541302377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:32,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:32,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:32,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586333795] [2025-03-09 01:13:32,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:32,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:32,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:32,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:32,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-03-09 01:13:32,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:32,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-03-09 01:13:32,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,682 INFO L124 PetriNetUnfolderBase]: 49/166 cut-off events. [2025-03-09 01:13:32,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:32,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 166 events. 49/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 689 event pairs, 35 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 281. Up to 88 conditions per place. [2025-03-09 01:13:32,684 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-09 01:13:32,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 135 flow [2025-03-09 01:13:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-09 01:13:32,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-03-09 01:13:32,687 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 73 flow. Second operand 3 states and 118 transitions. [2025-03-09 01:13:32,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 135 flow [2025-03-09 01:13:32,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:32,688 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-03-09 01:13:32,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-03-09 01:13:32,688 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-03-09 01:13:32,688 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-03-09 01:13:32,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:32,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:32,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:13:32,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:32,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1884460673, now seen corresponding path program 1 times [2025-03-09 01:13:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:32,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531439530] [2025-03-09 01:13:32,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:32,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:32,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:32,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531439530] [2025-03-09 01:13:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531439530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658327722] [2025-03-09 01:13:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:32,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:32,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-03-09 01:13:32,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-03-09 01:13:32,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:32,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-03-09 01:13:32,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,905 INFO L124 PetriNetUnfolderBase]: 42/143 cut-off events. [2025-03-09 01:13:32,905 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 01:13:32,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 143 events. 42/143 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 542 event pairs, 35 based on Foata normal form. 16/146 useless extension candidates. Maximal degree in co-relation 259. Up to 88 conditions per place. [2025-03-09 01:13:32,907 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-09 01:13:32,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-03-09 01:13:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-09 01:13:32,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-03-09 01:13:32,909 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-03-09 01:13:32,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-03-09 01:13:32,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:32,910 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-03-09 01:13:32,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-03-09 01:13:32,912 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-03-09 01:13:32,912 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-03-09 01:13:32,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-03-09 01:13:32,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:32,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:32,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:13:32,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:32,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash -489946146, now seen corresponding path program 1 times [2025-03-09 01:13:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:32,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283190335] [2025-03-09 01:13:32,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:32,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:13:32,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:13:32,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:33,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283190335] [2025-03-09 01:13:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283190335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:33,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:13:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771382754] [2025-03-09 01:13:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:33,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:33,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:33,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:33,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-09 01:13:33,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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-03-09 01:13:33,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:33,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-09 01:13:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:33,356 INFO L124 PetriNetUnfolderBase]: 77/214 cut-off events. [2025-03-09 01:13:33,357 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:13:33,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 214 events. 77/214 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 853 event pairs, 6 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 408. Up to 107 conditions per place. [2025-03-09 01:13:33,358 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 32 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2025-03-09 01:13:33,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 188 flow [2025-03-09 01:13:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-03-09 01:13:33,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5915032679738562 [2025-03-09 01:13:33,359 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 6 states and 181 transitions. [2025-03-09 01:13:33,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 188 flow [2025-03-09 01:13:33,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:33,362 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 112 flow [2025-03-09 01:13:33,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-03-09 01:13:33,362 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-03-09 01:13:33,362 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 112 flow [2025-03-09 01:13:33,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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-03-09 01:13:33,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:33,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:33,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:13:33,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:33,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash -489946145, now seen corresponding path program 1 times [2025-03-09 01:13:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475942671] [2025-03-09 01:13:33,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:33,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:13:33,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:13:33,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:33,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:33,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:33,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475942671] [2025-03-09 01:13:33,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475942671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:33,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:33,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086290826] [2025-03-09 01:13:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:33,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:13:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:33,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:13:33,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:13:33,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-03-09 01:13:33,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:33,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:33,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-03-09 01:13:33,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:33,757 INFO L124 PetriNetUnfolderBase]: 98/265 cut-off events. [2025-03-09 01:13:33,758 INFO L125 PetriNetUnfolderBase]: For 85/87 co-relation queries the response was YES. [2025-03-09 01:13:33,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 265 events. 98/265 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1158 event pairs, 6 based on Foata normal form. 12/270 useless extension candidates. Maximal degree in co-relation 599. Up to 101 conditions per place. [2025-03-09 01:13:33,759 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 37 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-03-09 01:13:33,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 238 flow [2025-03-09 01:13:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-09 01:13:33,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7098039215686275 [2025-03-09 01:13:33,762 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 112 flow. Second operand 5 states and 181 transitions. [2025-03-09 01:13:33,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 238 flow [2025-03-09 01:13:33,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:33,763 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 144 flow [2025-03-09 01:13:33,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2025-03-09 01:13:33,764 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-03-09 01:13:33,764 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 144 flow [2025-03-09 01:13:33,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:33,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:33,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:33,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:13:33,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:33,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash -12435120, now seen corresponding path program 1 times [2025-03-09 01:13:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571959006] [2025-03-09 01:13:33,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:33,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:13:33,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:13:33,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:33,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:34,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-03-09 01:13:34,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:34,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571959006] [2025-03-09 01:13:34,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571959006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:34,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:34,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:13:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494989088] [2025-03-09 01:13:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:34,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:13:34,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:34,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:13:34,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:13:34,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-03-09 01:13:34,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 144 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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-03-09 01:13:34,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:34,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-03-09 01:13:34,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:34,534 INFO L124 PetriNetUnfolderBase]: 106/293 cut-off events. [2025-03-09 01:13:34,534 INFO L125 PetriNetUnfolderBase]: For 248/254 co-relation queries the response was YES. [2025-03-09 01:13:34,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 293 events. 106/293 cut-off events. For 248/254 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1324 event pairs, 19 based on Foata normal form. 8/290 useless extension candidates. Maximal degree in co-relation 730. Up to 77 conditions per place. [2025-03-09 01:13:34,536 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 42 selfloop transitions, 19 changer transitions 0/67 dead transitions. [2025-03-09 01:13:34,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 400 flow [2025-03-09 01:13:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:13:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:13:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-03-09 01:13:34,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-03-09 01:13:34,537 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 144 flow. Second operand 9 states and 207 transitions. [2025-03-09 01:13:34,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 400 flow [2025-03-09 01:13:34,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:13:34,539 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 261 flow [2025-03-09 01:13:34,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-03-09 01:13:34,540 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-03-09 01:13:34,540 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 261 flow [2025-03-09 01:13:34,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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-03-09 01:13:34,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:34,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:34,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:13:34,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:34,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1655254493, now seen corresponding path program 1 times [2025-03-09 01:13:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:34,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428272319] [2025-03-09 01:13:34,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:34,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:13:34,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:13:34,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:34,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428272319] [2025-03-09 01:13:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428272319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:34,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:34,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:13:34,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397102870] [2025-03-09 01:13:34,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:34,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:13:34,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:34,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:13:34,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:13:35,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-03-09 01:13:35,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 261 flow. Second operand has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 11 states have internal predecessors, (200), 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-03-09 01:13:35,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:35,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-03-09 01:13:35,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:35,353 INFO L124 PetriNetUnfolderBase]: 106/292 cut-off events. [2025-03-09 01:13:35,353 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-03-09 01:13:35,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 292 events. 106/292 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1292 event pairs, 19 based on Foata normal form. 8/288 useless extension candidates. Maximal degree in co-relation 835. Up to 77 conditions per place. [2025-03-09 01:13:35,358 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 43 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2025-03-09 01:13:35,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 465 flow [2025-03-09 01:13:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:13:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:13:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2025-03-09 01:13:35,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44509803921568625 [2025-03-09 01:13:35,359 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 261 flow. Second operand 10 states and 227 transitions. [2025-03-09 01:13:35,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 465 flow [2025-03-09 01:13:35,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:35,365 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 338 flow [2025-03-09 01:13:35,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=338, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-03-09 01:13:35,366 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2025-03-09 01:13:35,367 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 338 flow [2025-03-09 01:13:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 11 states have internal predecessors, (200), 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-03-09 01:13:35,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:35,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:35,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:13:35,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1686394329, now seen corresponding path program 1 times [2025-03-09 01:13:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92358129] [2025-03-09 01:13:35,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:35,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:35,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:35,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:35,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:13:35,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:13:35,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:35,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:35,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:35,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:13:35,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:13:35,436 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:13:35,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-03-09 01:13:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-03-09 01:13:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-03-09 01:13:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-03-09 01:13:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-03-09 01:13:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-03-09 01:13:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-03-09 01:13:35,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-03-09 01:13:35,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-03-09 01:13:35,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-03-09 01:13:35,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-03-09 01:13:35,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-03-09 01:13:35,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-03-09 01:13:35,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-03-09 01:13:35,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-03-09 01:13:35,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-03-09 01:13:35,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-03-09 01:13:35,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:13:35,444 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:35,473 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:13:35,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:13:35,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:13:35 BasicIcfg [2025-03-09 01:13:35,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:13:35,478 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:13:35,478 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:13:35,478 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:13:35,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:31" (3/4) ... [2025-03-09 01:13:35,479 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:13:35,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:13:35,481 INFO L158 Benchmark]: Toolchain (without parser) took 5592.93ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 129.4MB in the beginning and 204.8MB in the end (delta: -75.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2025-03-09 01:13:35,481 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:35,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.74ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 91.6MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 01:13:35,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 89.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:35,481 INFO L158 Benchmark]: Boogie Preprocessor took 30.53ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 86.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:35,481 INFO L158 Benchmark]: IcfgBuilder took 633.63ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 114.8MB in the end (delta: -28.3MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2025-03-09 01:13:35,482 INFO L158 Benchmark]: TraceAbstraction took 4408.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 113.9MB in the beginning and 204.8MB in the end (delta: -91.0MB). Peak memory consumption was 123.8MB. Max. memory is 16.1GB. [2025-03-09 01:13:35,482 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 243.3MB. Free memory was 204.8MB in the beginning and 204.8MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:35,483 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.74ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 91.6MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 89.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.53ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 86.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 633.63ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 114.8MB in the end (delta: -28.3MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4408.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 113.9MB in the beginning and 204.8MB in the end (delta: -91.0MB). Peak memory consumption was 123.8MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 243.3MB. Free memory was 204.8MB in the beginning and 204.8MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1244]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1244. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1247] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(p,9) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1249] RET 0 init(A,3) [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, p={-2:0}, t1=-1] [L1253] EXPR 0 A->next [L1253] 0 p = A->next [L1254] 0 p->datum [L1256] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, \result=0, p={-2:0}, t1=-1] - 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: 1251]: 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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 72 edges, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1198 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 800 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2192 IncrementalHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 53 mSDtfsCounter, 2192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=10, InterpolantAutomatonStates: 49, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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-03-09 01:13:35,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:37,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:37,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 01:13:37,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:37,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:37,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:37,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:37,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:37,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:37,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:37,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:37,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:37,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:37,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:37,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:37,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:37,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:37,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:37,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 01:13:37,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:37,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:37,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:37,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:37,499 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/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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2025-03-09 01:13:37,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:37,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:37,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:37,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:37,746 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:37,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-09 01:13:38,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67330e0b5/9d0f7ee5d6014f9788586f9ef29f72b2/FLAGac15b7739 [2025-03-09 01:13:39,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:39,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-09 01:13:39,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67330e0b5/9d0f7ee5d6014f9788586f9ef29f72b2/FLAGac15b7739 [2025-03-09 01:13:39,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67330e0b5/9d0f7ee5d6014f9788586f9ef29f72b2 [2025-03-09 01:13:39,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:39,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:39,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:39,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:39,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:39,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:39,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bbd4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39, skipping insertion in model container [2025-03-09 01:13:39,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:39,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:39,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:39,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:39,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:39,976 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:39,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39 WrapperNode [2025-03-09 01:13:39,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:39,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:39,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:39,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:39,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,020 INFO L138 Inliner]: procedures = 369, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2025-03-09 01:13:40,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:40,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:40,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:40,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:40,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,046 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [5, 12]. 71 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0]. The 9 writes are split as follows [0, 9]. [2025-03-09 01:13:40,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:40,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:40,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:40,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:40,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (1/1) ... [2025-03-09 01:13:40,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:40,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:40,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:13:40,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:13:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 01:13:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:13:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:13:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:13:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:40,121 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:40,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:40,122 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:40,242 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:40,243 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:40,598 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:40,598 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:40,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:40,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:40,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:40 BoogieIcfgContainer [2025-03-09 01:13:40,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:40,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:40,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:40,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:40,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:39" (1/3) ... [2025-03-09 01:13:40,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f28fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:40, skipping insertion in model container [2025-03-09 01:13:40,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:39" (2/3) ... [2025-03-09 01:13:40,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f28fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:40, skipping insertion in model container [2025-03-09 01:13:40,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:40" (3/3) ... [2025-03-09 01:13:40,802 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-03-09 01:13:40,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:40,812 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 52 locations, 1 initial locations, 0 loop locations, and 25 error locations. [2025-03-09 01:13:40,812 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:40,868 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:40,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-03-09 01:13:40,924 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-09 01:13:40,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:40,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-09 01:13:40,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-03-09 01:13:40,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-03-09 01:13:40,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:40,947 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;@3db7fb2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:40,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-09 01:13:40,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:40,950 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-09 01:13:40,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:40,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:40,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:13:40,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:40,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:40,954 INFO L85 PathProgramCache]: Analyzing trace with hash 11715, now seen corresponding path program 1 times [2025-03-09 01:13:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025423391] [2025-03-09 01:13:40,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:40,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:40,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:40,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:40,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:13:41,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:13:41,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:13:41,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:41,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:41,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:13:41,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:41,129 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-03-09 01:13:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:41,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:41,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:41,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025423391] [2025-03-09 01:13:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025423391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:41,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628801084] [2025-03-09 01:13:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:41,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:41,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:41,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-03-09 01:13:41,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:41,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:41,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-03-09 01:13:41,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:41,367 INFO L124 PetriNetUnfolderBase]: 42/172 cut-off events. [2025-03-09 01:13:41,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:41,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 172 events. 42/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 742 event pairs, 42 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 256. Up to 101 conditions per place. [2025-03-09 01:13:41,370 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-09 01:13:41,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-03-09 01:13:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-09 01:13:41,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-03-09 01:13:41,383 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-03-09 01:13:41,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-03-09 01:13:41,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:41,391 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-03-09 01:13:41,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-03-09 01:13:41,398 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-09 01:13:41,399 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-03-09 01:13:41,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:41,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:41,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:13:41,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:13:41,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:41,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 11716, now seen corresponding path program 1 times [2025-03-09 01:13:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415903248] [2025-03-09 01:13:41,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:41,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:41,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:41,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:41,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:13:41,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:13:41,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:13:41,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:41,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:41,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:13:41,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:41,721 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-03-09 01:13:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:41,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:41,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:41,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415903248] [2025-03-09 01:13:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415903248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:41,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289277427] [2025-03-09 01:13:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:41,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:41,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:41,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:41,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-09 01:13:41,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:41,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:41,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-09 01:13:41,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:41,902 INFO L124 PetriNetUnfolderBase]: 42/168 cut-off events. [2025-03-09 01:13:41,903 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:41,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 168 events. 42/168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 733 event pairs, 42 based on Foata normal form. 3/138 useless extension candidates. Maximal degree in co-relation 264. Up to 101 conditions per place. [2025-03-09 01:13:41,905 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-09 01:13:41,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-03-09 01:13:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-09 01:13:41,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-03-09 01:13:41,908 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-03-09 01:13:41,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-03-09 01:13:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:41,909 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-03-09 01:13:41,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-09 01:13:41,910 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-03-09 01:13:41,910 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-03-09 01:13:41,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:41,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:41,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:13:41,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:13:42,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:42,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:42,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2056734700, now seen corresponding path program 1 times [2025-03-09 01:13:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:42,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336404700] [2025-03-09 01:13:42,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:42,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:42,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:42,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:42,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:13:42,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:13:42,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:13:42,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:42,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:42,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:13:42,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:42,216 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-03-09 01:13:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:42,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:42,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:42,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336404700] [2025-03-09 01:13:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336404700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:42,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41534504] [2025-03-09 01:13:42,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:42,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:42,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:42,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:42,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2025-03-09 01:13:42,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-09 01:13:42,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:42,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2025-03-09 01:13:42,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:42,348 INFO L124 PetriNetUnfolderBase]: 49/174 cut-off events. [2025-03-09 01:13:42,348 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:42,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 174 events. 49/174 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 725 event pairs, 49 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 285. Up to 116 conditions per place. [2025-03-09 01:13:42,349 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-03-09 01:13:42,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 120 flow [2025-03-09 01:13:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-09 01:13:42,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6993464052287581 [2025-03-09 01:13:42,350 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 107 transitions. [2025-03-09 01:13:42,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 120 flow [2025-03-09 01:13:42,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:42,351 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 80 flow [2025-03-09 01:13:42,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-09 01:13:42,352 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-03-09 01:13:42,352 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 80 flow [2025-03-09 01:13:42,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-09 01:13:42,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:42,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:13:42,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:13:42,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:42,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:42,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2056734699, now seen corresponding path program 1 times [2025-03-09 01:13:42,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:42,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889686097] [2025-03-09 01:13:42,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:42,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:42,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:42,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:42,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:13:42,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:13:42,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:13:42,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:42,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:42,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:13:42,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:42,669 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-03-09 01:13:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:42,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:42,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:42,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889686097] [2025-03-09 01:13:42,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889686097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584317881] [2025-03-09 01:13:42,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:42,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:42,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:42,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:42,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-09 01:13:42,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-09 01:13:42,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:42,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-09 01:13:42,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:42,838 INFO L124 PetriNetUnfolderBase]: 42/144 cut-off events. [2025-03-09 01:13:42,838 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:42,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 144 events. 42/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 542 event pairs, 42 based on Foata normal form. 8/135 useless extension candidates. Maximal degree in co-relation 243. Up to 101 conditions per place. [2025-03-09 01:13:42,839 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 17 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-03-09 01:13:42,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 108 flow [2025-03-09 01:13:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-09 01:13:42,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-03-09 01:13:42,843 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 80 flow. Second operand 3 states and 109 transitions. [2025-03-09 01:13:42,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 108 flow [2025-03-09 01:13:42,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:42,844 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 73 flow [2025-03-09 01:13:42,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-09 01:13:42,845 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-03-09 01:13:42,845 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 73 flow [2025-03-09 01:13:42,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-09 01:13:42,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:42,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:42,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:13:43,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:43,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash -179574656, now seen corresponding path program 1 times [2025-03-09 01:13:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850155855] [2025-03-09 01:13:43,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:43,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:43,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:43,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:43,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:13:43,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:43,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:43,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:43,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:13:43,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:43,161 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-03-09 01:13:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:43,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:43,165 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850155855] [2025-03-09 01:13:43,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850155855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:43,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:43,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535834009] [2025-03-09 01:13:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:43,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:43,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:43,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:43,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-03-09 01:13:43,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:43,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:43,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-03-09 01:13:43,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:43,327 INFO L124 PetriNetUnfolderBase]: 49/166 cut-off events. [2025-03-09 01:13:43,328 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:43,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 166 events. 49/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 689 event pairs, 35 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 280. Up to 88 conditions per place. [2025-03-09 01:13:43,331 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-09 01:13:43,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 135 flow [2025-03-09 01:13:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-09 01:13:43,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-03-09 01:13:43,335 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 73 flow. Second operand 3 states and 118 transitions. [2025-03-09 01:13:43,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 135 flow [2025-03-09 01:13:43,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:43,336 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-03-09 01:13:43,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-03-09 01:13:43,336 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-03-09 01:13:43,336 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-03-09 01:13:43,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:43,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:43,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:43,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:13:43,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:43,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:43,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -179574655, now seen corresponding path program 1 times [2025-03-09 01:13:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:43,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715061090] [2025-03-09 01:13:43,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:43,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:43,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:13:43,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:43,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:43,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:43,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:43,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:13:43,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:43,667 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-03-09 01:13:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:43,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:43,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715061090] [2025-03-09 01:13:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715061090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232407962] [2025-03-09 01:13:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:43,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:43,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:43,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:43,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-03-09 01:13:43,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-03-09 01:13:43,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:43,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-03-09 01:13:43,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:43,855 INFO L124 PetriNetUnfolderBase]: 42/143 cut-off events. [2025-03-09 01:13:43,855 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 01:13:43,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 143 events. 42/143 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 543 event pairs, 35 based on Foata normal form. 16/147 useless extension candidates. Maximal degree in co-relation 258. Up to 88 conditions per place. [2025-03-09 01:13:43,857 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-09 01:13:43,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-03-09 01:13:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-09 01:13:43,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-03-09 01:13:43,859 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-03-09 01:13:43,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-03-09 01:13:43,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:43,860 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-03-09 01:13:43,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-03-09 01:13:43,861 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-03-09 01:13:43,861 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-03-09 01:13:43,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-03-09 01:13:43,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:43,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:43,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:13:44,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:44,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1781142878, now seen corresponding path program 1 times [2025-03-09 01:13:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31476615] [2025-03-09 01:13:44,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:44,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:44,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:44,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:44,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:13:44,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:13:44,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:13:44,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:44,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:44,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:13:44,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:44,178 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-03-09 01:13:44,209 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-03-09 01:13:44,210 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 16 treesize of output 17 [2025-03-09 01:13:44,266 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 19 treesize of output 1 [2025-03-09 01:13:44,307 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 23 treesize of output 11 [2025-03-09 01:13:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:44,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:44,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31476615] [2025-03-09 01:13:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31476615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:44,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834576574] [2025-03-09 01:13:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:13:44,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:44,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:13:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:13:44,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-09 01:13:44,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:44,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:44,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-09 01:13:44,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:44,744 INFO L124 PetriNetUnfolderBase]: 98/267 cut-off events. [2025-03-09 01:13:44,744 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-09 01:13:44,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 267 events. 98/267 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1153 event pairs, 6 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 508. Up to 103 conditions per place. [2025-03-09 01:13:44,745 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 38 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2025-03-09 01:13:44,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 230 flow [2025-03-09 01:13:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:13:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:13:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-03-09 01:13:44,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5994397759103641 [2025-03-09 01:13:44,747 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 7 states and 214 transitions. [2025-03-09 01:13:44,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 230 flow [2025-03-09 01:13:44,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:44,750 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 138 flow [2025-03-09 01:13:44,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-03-09 01:13:44,751 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-03-09 01:13:44,752 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 138 flow [2025-03-09 01:13:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:44,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:44,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:44,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:13:44,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:44,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1781142879, now seen corresponding path program 1 times [2025-03-09 01:13:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74595488] [2025-03-09 01:13:44,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:44,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:44,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:44,956 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:44,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:13:45,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:13:45,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:13:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:45,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:13:45,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:45,070 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-03-09 01:13:45,101 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:13:45,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:13:45,140 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 13 treesize of output 9 [2025-03-09 01:13:45,150 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 19 treesize of output 1 [2025-03-09 01:13:45,210 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 21 treesize of output 9 [2025-03-09 01:13:45,213 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 9 treesize of output 3 [2025-03-09 01:13:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:45,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:45,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:45,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74595488] [2025-03-09 01:13:45,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74595488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:45,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:45,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515889626] [2025-03-09 01:13:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:45,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:45,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:45,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:45,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-03-09 01:13:45,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-03-09 01:13:45,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:45,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-03-09 01:13:45,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:45,555 INFO L124 PetriNetUnfolderBase]: 110/298 cut-off events. [2025-03-09 01:13:45,555 INFO L125 PetriNetUnfolderBase]: For 121/123 co-relation queries the response was YES. [2025-03-09 01:13:45,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 298 events. 110/298 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1354 event pairs, 16 based on Foata normal form. 12/300 useless extension candidates. Maximal degree in co-relation 704. Up to 127 conditions per place. [2025-03-09 01:13:45,557 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 39 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2025-03-09 01:13:45,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 274 flow [2025-03-09 01:13:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2025-03-09 01:13:45,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797385620915033 [2025-03-09 01:13:45,558 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 138 flow. Second operand 6 states and 208 transitions. [2025-03-09 01:13:45,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 274 flow [2025-03-09 01:13:45,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:45,560 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 172 flow [2025-03-09 01:13:45,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-03-09 01:13:45,561 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-09 01:13:45,561 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 172 flow [2025-03-09 01:13:45,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-03-09 01:13:45,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:45,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:45,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:13:45,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:45,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:45,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash 660730639, now seen corresponding path program 1 times [2025-03-09 01:13:45,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451108619] [2025-03-09 01:13:45,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:45,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:45,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:13:45,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:13:45,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:13:45,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:45,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:45,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:13:45,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:45,889 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-03-09 01:13:45,910 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-03-09 01:13:45,910 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 16 treesize of output 17 [2025-03-09 01:13:45,949 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 19 treesize of output 1 [2025-03-09 01:13:45,997 INFO L349 Elim1Store]: treesize reduction 82, result has 29.9 percent of original size [2025-03-09 01:13:45,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 48 [2025-03-09 01:13:46,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 25 [2025-03-09 01:13:46,145 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 33 treesize of output 15 [2025-03-09 01:13:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:46,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:46,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451108619] [2025-03-09 01:13:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451108619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:46,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:13:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486238609] [2025-03-09 01:13:46,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:46,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:13:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:46,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:13:46,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:13:46,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2025-03-09 01:13:46,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 172 flow. Second operand has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 9 states have internal predecessors, (202), 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-03-09 01:13:46,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:46,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2025-03-09 01:13:46,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:47,263 INFO L124 PetriNetUnfolderBase]: 118/321 cut-off events. [2025-03-09 01:13:47,264 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2025-03-09 01:13:47,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 321 events. 118/321 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1515 event pairs, 9 based on Foata normal form. 8/318 useless extension candidates. Maximal degree in co-relation 821. Up to 97 conditions per place. [2025-03-09 01:13:47,265 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 49 selfloop transitions, 24 changer transitions 0/79 dead transitions. [2025-03-09 01:13:47,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 476 flow [2025-03-09 01:13:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:13:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:13:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 316 transitions. [2025-03-09 01:13:47,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5163398692810458 [2025-03-09 01:13:47,267 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 172 flow. Second operand 12 states and 316 transitions. [2025-03-09 01:13:47,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 476 flow [2025-03-09 01:13:47,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 459 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:47,269 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 316 flow [2025-03-09 01:13:47,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-03-09 01:13:47,269 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2025-03-09 01:13:47,270 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 316 flow [2025-03-09 01:13:47,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 9 states have internal predecessors, (202), 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-03-09 01:13:47,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:47,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:47,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:13:47,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:47,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:47,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1966547042, now seen corresponding path program 1 times [2025-03-09 01:13:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:47,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261912097] [2025-03-09 01:13:47,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:47,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:47,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:47,473 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:47,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:13:47,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:13:47,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:13:47,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:47,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:47,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 01:13:47,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:47,602 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-03-09 01:13:47,608 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-03-09 01:13:47,637 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:13:47,637 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 14 treesize of output 13 [2025-03-09 01:13:47,650 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 01:13:47,650 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-03-09 01:13:47,708 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 19 treesize of output 1 [2025-03-09 01:13:47,717 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 13 treesize of output 9 [2025-03-09 01:13:47,778 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 01:13:47,778 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-03-09 01:13:47,795 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-09 01:13:47,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-03-09 01:13:47,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 23 [2025-03-09 01:13:47,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-03-09 01:13:47,916 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 31 treesize of output 13 [2025-03-09 01:13:47,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 01:13:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:47,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:13:47,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:13:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261912097] [2025-03-09 01:13:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261912097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:13:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602138392] [2025-03-09 01:13:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:47,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:13:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:13:47,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:13:47,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:13:48,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-03-09 01:13:48,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 316 flow. Second operand has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 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-03-09 01:13:48,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:48,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-03-09 01:13:48,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:49,006 INFO L124 PetriNetUnfolderBase]: 121/327 cut-off events. [2025-03-09 01:13:49,006 INFO L125 PetriNetUnfolderBase]: For 511/511 co-relation queries the response was YES. [2025-03-09 01:13:49,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 327 events. 121/327 cut-off events. For 511/511 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1505 event pairs, 22 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 964. Up to 89 conditions per place. [2025-03-09 01:13:49,007 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 40 selfloop transitions, 35 changer transitions 0/80 dead transitions. [2025-03-09 01:13:49,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 576 flow [2025-03-09 01:13:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:13:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:13:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 328 transitions. [2025-03-09 01:13:49,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5359477124183006 [2025-03-09 01:13:49,010 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 316 flow. Second operand 12 states and 328 transitions. [2025-03-09 01:13:49,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 576 flow [2025-03-09 01:13:49,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 80 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:49,015 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 461 flow [2025-03-09 01:13:49,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=461, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2025-03-09 01:13:49,016 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2025-03-09 01:13:49,017 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 461 flow [2025-03-09 01:13:49,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 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-03-09 01:13:49,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:49,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:49,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:13:49,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:49,218 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-09 01:13:49,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:49,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2001875049, now seen corresponding path program 1 times [2025-03-09 01:13:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:13:49,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306116594] [2025-03-09 01:13:49,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:49,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:49,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:49,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:13:49,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:49,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:13:49,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:13:49,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:49,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:49,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:13:49,868 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 01:13:49,868 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:13:49,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-03-09 01:13:49,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-03-09 01:13:49,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-03-09 01:13:49,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-03-09 01:13:49,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:13:50,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:50,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:50,100 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:13:50,100 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:13:50,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:13:50 BasicIcfg [2025-03-09 01:13:50,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:13:50,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:13:50,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:13:50,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:13:50,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:40" (3/4) ... [2025-03-09 01:13:50,108 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:13:50,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:13:50,109 INFO L158 Benchmark]: Toolchain (without parser) took 10655.44ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 74.7MB in the beginning and 62.4MB in the end (delta: 12.3MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2025-03-09 01:13:50,109 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:50,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.76ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 71.5MB in the end (delta: 3.1MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2025-03-09 01:13:50,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.62ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 68.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:50,110 INFO L158 Benchmark]: Boogie Preprocessor took 48.51ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 65.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:50,110 INFO L158 Benchmark]: IcfgBuilder took 725.33ms. Allocated memory is still 100.7MB. Free memory was 65.9MB in the beginning and 37.1MB in the end (delta: 28.8MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2025-03-09 01:13:50,110 INFO L158 Benchmark]: TraceAbstraction took 9309.12ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 36.5MB in the beginning and 62.4MB in the end (delta: -25.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:50,110 INFO L158 Benchmark]: Witness Printer took 2.40ms. Allocated memory is still 125.8MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 13.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:50,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.76ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 71.5MB in the end (delta: 3.1MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.62ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 68.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.51ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 65.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 725.33ms. Allocated memory is still 100.7MB. Free memory was 65.9MB in the beginning and 37.1MB in the end (delta: 28.8MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9309.12ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 36.5MB in the beginning and 62.4MB in the end (delta: -25.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.40ms. Allocated memory is still 125.8MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 13.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1244]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1244. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1247] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(p,9) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-2147483648:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1249] RET 0 init(A,3) [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2147483648:0}, A_mutex={1:0}, p={2:0}, t1=0] [L1253] EXPR 0 A->next [L1253] 0 p = A->next [L1254] 0 p->datum [L1256] 0 return 0; VAL [A={-2147483648:0}, A_mutex={1:0}, \result=0, p={2:0}, t1=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: 1251]: 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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 72 edges, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1813 IncrementalHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 44 mSDtfsCounter, 1813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=10, InterpolantAutomatonStates: 55, 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.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 76 ConstructedInterpolants, 6 QuantifiedInterpolants, 1173 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1410 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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-03-09 01:13:50,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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