./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 14:16:48,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:48,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:16:48,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:48,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:16:48,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:16:48,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:16:48,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:16:48,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:16:48,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:16:48,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:16:48,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:16:48,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:16:48,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:16:48,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:16:48,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:16:48,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:16:48,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:16:48,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:16:48,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:48,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:16:48,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:16:48,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:16:48,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:16:48,500 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-17 14:16:48,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:16:48,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:16:48,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:16:48,821 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:16:48,821 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:16:48,823 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-17 14:16:49,990 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0e90edf/38e048f10bf5475d882ba5ad628ddf0c/FLAG30986f10d [2025-03-17 14:16:50,302 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:16:50,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-17 14:16:50,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0e90edf/38e048f10bf5475d882ba5ad628ddf0c/FLAG30986f10d [2025-03-17 14:16:50,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0e90edf/38e048f10bf5475d882ba5ad628ddf0c [2025-03-17 14:16:50,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:16:50,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:16:50,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:50,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:16:50,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:16:50,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4259f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50, skipping insertion in model container [2025-03-17 14:16:50,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:16:50,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:50,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:16:50,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:50,839 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:16:50,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50 WrapperNode [2025-03-17 14:16:50,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:50,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:50,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:16:50,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:16:50,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,875 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-17 14:16:50,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:50,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:16:50,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:16:50,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:16:50,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,892 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-17 14:16:50,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:16:50,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:16:50,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:16:50,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:16:50,913 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (1/1) ... [2025-03-17 14:16:50,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:50,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:50,933 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-17 14:16:50,935 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-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:16:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:16:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:16:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:16:50,951 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:16:51,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:16:51,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:16:51,288 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:16:51,289 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:16:51,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:16:51,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:16:51,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:51 BoogieIcfgContainer [2025-03-17 14:16:51,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:16:51,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:16:51,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:16:51,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:16:51,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:16:50" (1/3) ... [2025-03-17 14:16:51,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728174d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:51, skipping insertion in model container [2025-03-17 14:16:51,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:50" (2/3) ... [2025-03-17 14:16:51,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728174d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:51, skipping insertion in model container [2025-03-17 14:16:51,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:51" (3/3) ... [2025-03-17 14:16:51,488 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-03-17 14:16:51,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:16:51,500 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-17 14:16:51,501 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:16:51,544 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:16:51,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-03-17 14:16:51,589 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 14:16:51,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:51,593 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-17 14:16:51,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-03-17 14:16:51,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-03-17 14:16:51,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:16:51,612 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;@559f2f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:16:51,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-17 14:16:51,617 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:16:51,617 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-17 14:16:51,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:51,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:51,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:16:51,618 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-17 14:16:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 11459, now seen corresponding path program 1 times [2025-03-17 14:16:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:51,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166657997] [2025-03-17 14:16:51,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:51,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:16:51,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:16:51,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:51,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:51,925 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-17 14:16:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166657997] [2025-03-17 14:16:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166657997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:16:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671612493] [2025-03-17 14:16:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:51,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:51,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:51,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-03-17 14:16:51,999 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-17 14:16:51,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:51,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-03-17 14:16:52,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:52,089 INFO L124 PetriNetUnfolderBase]: 42/172 cut-off events. [2025-03-17 14:16:52,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:52,091 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 750 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-17 14:16:52,094 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-17 14:16:52,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-03-17 14:16:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-17 14:16:52,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-03-17 14:16:52,108 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-03-17 14:16:52,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-03-17 14:16:52,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:52,114 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-03-17 14:16:52,116 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-17 14:16:52,120 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-17 14:16:52,120 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-03-17 14:16:52,120 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-17 14:16:52,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:52,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:16:52,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:16:52,121 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-17 14:16:52,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:52,122 INFO L85 PathProgramCache]: Analyzing trace with hash 11460, now seen corresponding path program 1 times [2025-03-17 14:16:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:52,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377950471] [2025-03-17 14:16:52,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:16:52,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:16:52,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:52,285 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-17 14:16:52,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377950471] [2025-03-17 14:16:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377950471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:52,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:52,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:16:52,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426616859] [2025-03-17 14:16:52,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:52,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:52,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:52,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:52,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-17 14:16:52,334 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-17 14:16:52,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:52,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-17 14:16:52,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:52,421 INFO L124 PetriNetUnfolderBase]: 42/168 cut-off events. [2025-03-17 14:16:52,421 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:16:52,422 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 742 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-17 14:16:52,422 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-17 14:16:52,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-03-17 14:16:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-17 14:16:52,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-03-17 14:16:52,427 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-03-17 14:16:52,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-03-17 14:16:52,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:52,428 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-03-17 14:16:52,428 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-17 14:16:52,428 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-03-17 14:16:52,428 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-03-17 14:16:52,428 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-17 14:16:52,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:52,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:16:52,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:16:52,429 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-17 14:16:52,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2002369558, now seen corresponding path program 1 times [2025-03-17 14:16:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:52,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281007283] [2025-03-17 14:16:52,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:16:52,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:16:52,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:52,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:52,537 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-17 14:16:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281007283] [2025-03-17 14:16:52,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281007283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:52,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:52,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:16:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264677687] [2025-03-17 14:16:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:52,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:16:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:52,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:16:52,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:16:52,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-03-17 14:16:52,631 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-17 14:16:52,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:52,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-03-17 14:16:52,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:52,702 INFO L124 PetriNetUnfolderBase]: 49/174 cut-off events. [2025-03-17 14:16:52,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:52,703 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 733 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-17 14:16:52,704 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 19 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-03-17 14:16:52,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 124 flow [2025-03-17 14:16:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-03-17 14:16:52,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2025-03-17 14:16:52,705 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 4 states and 113 transitions. [2025-03-17 14:16:52,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 124 flow [2025-03-17 14:16:52,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:52,710 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 82 flow [2025-03-17 14:16:52,710 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-17 14:16:52,711 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-03-17 14:16:52,711 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 82 flow [2025-03-17 14:16:52,711 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-17 14:16:52,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:52,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:16:52,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:16:52,711 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-17 14:16:52,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2002369559, now seen corresponding path program 1 times [2025-03-17 14:16:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549886] [2025-03-17 14:16:52,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:16:52,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:16:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:52,879 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-17 14:16:52,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:52,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549886] [2025-03-17 14:16:52,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:52,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:52,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:16:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665466414] [2025-03-17 14:16:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:52,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:52,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:52,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:52,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-17 14:16:52,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-17 14:16:52,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:52,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-17 14:16:52,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:53,012 INFO L124 PetriNetUnfolderBase]: 42/144 cut-off events. [2025-03-17 14:16:53,012 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:16:53,012 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 543 event pairs, 42 based on Foata normal form. 8/135 useless extension candidates. Maximal degree in co-relation 240. Up to 100 conditions per place. [2025-03-17 14:16:53,014 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-03-17 14:16:53,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 110 flow [2025-03-17 14:16:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-03-17 14:16:53,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-03-17 14:16:53,018 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 82 flow. Second operand 4 states and 138 transitions. [2025-03-17 14:16:53,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 110 flow [2025-03-17 14:16:53,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:53,019 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 75 flow [2025-03-17 14:16:53,019 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-03-17 14:16:53,020 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2025-03-17 14:16:53,020 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 75 flow [2025-03-17 14:16:53,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-17 14:16:53,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:53,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:53,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:16:53,020 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-17 14:16:53,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash -208846437, now seen corresponding path program 1 times [2025-03-17 14:16:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:53,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457874471] [2025-03-17 14:16:53,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:53,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:16:53,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:16:53,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:53,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:53,123 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-17 14:16:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457874471] [2025-03-17 14:16:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457874471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971851880] [2025-03-17 14:16:53,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:53,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:53,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-03-17 14:16:53,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 75 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-17 14:16:53,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:53,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-03-17 14:16:53,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:53,204 INFO L124 PetriNetUnfolderBase]: 49/160 cut-off events. [2025-03-17 14:16:53,205 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:16:53,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 160 events. 49/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 612 event pairs, 31 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 271. Up to 88 conditions per place. [2025-03-17 14:16:53,206 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-17 14:16:53,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 137 flow [2025-03-17 14:16:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-17 14:16:53,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-03-17 14:16:53,207 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 75 flow. Second operand 3 states and 118 transitions. [2025-03-17 14:16:53,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 137 flow [2025-03-17 14:16:53,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:53,208 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-03-17 14:16:53,208 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-17 14:16:53,208 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-03-17 14:16:53,208 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-03-17 14:16:53,208 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-17 14:16:53,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:53,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:16:53,209 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-17 14:16:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -208846436, now seen corresponding path program 1 times [2025-03-17 14:16:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121763892] [2025-03-17 14:16:53,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:53,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:16:53,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:16:53,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:53,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:53,337 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-17 14:16:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121763892] [2025-03-17 14:16:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121763892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:53,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610751652] [2025-03-17 14:16:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:53,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:53,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:53,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:53,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-03-17 14:16:53,369 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-17 14:16:53,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:53,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-03-17 14:16:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:53,420 INFO L124 PetriNetUnfolderBase]: 42/139 cut-off events. [2025-03-17 14:16:53,420 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 14:16:53,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 139 events. 42/139 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 515 event pairs, 26 based on Foata normal form. 16/142 useless extension candidates. Maximal degree in co-relation 251. Up to 88 conditions per place. [2025-03-17 14:16:53,421 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-17 14:16:53,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-03-17 14:16:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-17 14:16:53,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-03-17 14:16:53,423 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-03-17 14:16:53,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-03-17 14:16:53,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:53,424 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-03-17 14:16:53,424 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-17 14:16:53,424 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-03-17 14:16:53,424 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-03-17 14:16:53,424 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-17 14:16:53,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:53,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:53,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:16:53,424 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-17 14:16:53,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1623873211, now seen corresponding path program 1 times [2025-03-17 14:16:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329820705] [2025-03-17 14:16:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:16:53,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:16:53,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:53,618 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-17 14:16:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329820705] [2025-03-17 14:16:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329820705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:53,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:16:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532208190] [2025-03-17 14:16:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:53,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:16:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:53,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:16:53,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:16:53,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-17 14:16:53,777 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-17 14:16:53,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:53,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-17 14:16:53,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:53,869 INFO L124 PetriNetUnfolderBase]: 77/214 cut-off events. [2025-03-17 14:16:53,869 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 14:16:53,870 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 846 event pairs, 6 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 403. Up to 107 conditions per place. [2025-03-17 14:16:53,871 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 32 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2025-03-17 14:16:53,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 188 flow [2025-03-17 14:16:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:16:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:16:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-03-17 14:16:53,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5915032679738562 [2025-03-17 14:16:53,872 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 6 states and 181 transitions. [2025-03-17 14:16:53,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 188 flow [2025-03-17 14:16:53,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:53,875 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 112 flow [2025-03-17 14:16:53,875 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-17 14:16:53,875 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-03-17 14:16:53,876 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 112 flow [2025-03-17 14:16:53,876 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-17 14:16:53,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:53,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:53,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:16:53,876 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-17 14:16:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1623873212, now seen corresponding path program 1 times [2025-03-17 14:16:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058810798] [2025-03-17 14:16:53,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:53,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:16:53,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:16:53,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:53,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:54,130 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-17 14:16:54,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058810798] [2025-03-17 14:16:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058810798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:54,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:54,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:16:54,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463495636] [2025-03-17 14:16:54,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:54,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:16:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:54,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:16:54,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:16:54,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-03-17 14:16:54,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 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-17 14:16:54,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:54,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-03-17 14:16:54,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:54,414 INFO L124 PetriNetUnfolderBase]: 105/272 cut-off events. [2025-03-17 14:16:54,416 INFO L125 PetriNetUnfolderBase]: For 85/87 co-relation queries the response was YES. [2025-03-17 14:16:54,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 272 events. 105/272 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1137 event pairs, 2 based on Foata normal form. 12/277 useless extension candidates. Maximal degree in co-relation 616. Up to 115 conditions per place. [2025-03-17 14:16:54,417 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 44 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2025-03-17 14:16:54,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 280 flow [2025-03-17 14:16:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:16:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:16:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2025-03-17 14:16:54,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2025-03-17 14:16:54,419 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 112 flow. Second operand 8 states and 200 transitions. [2025-03-17 14:16:54,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 280 flow [2025-03-17 14:16:54,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:54,420 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 153 flow [2025-03-17 14:16:54,420 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=153, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-03-17 14:16:54,421 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-17 14:16:54,421 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 153 flow [2025-03-17 14:16:54,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 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-17 14:16:54,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:54,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:16:54,423 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-17 14:16:54,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash -151559283, now seen corresponding path program 1 times [2025-03-17 14:16:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34962603] [2025-03-17 14:16:54,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:54,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:16:54,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:16:54,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:54,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:54,805 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-17 14:16:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:54,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34962603] [2025-03-17 14:16:54,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34962603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:54,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:54,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:16:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90724438] [2025-03-17 14:16:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:54,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:16:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:54,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:16:54,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:16:54,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2025-03-17 14:16:54,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-17 14:16:54,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:54,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2025-03-17 14:16:54,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:55,045 INFO L124 PetriNetUnfolderBase]: 106/291 cut-off events. [2025-03-17 14:16:55,046 INFO L125 PetriNetUnfolderBase]: For 241/247 co-relation queries the response was YES. [2025-03-17 14:16:55,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 291 events. 106/291 cut-off events. For 241/247 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1309 event pairs, 19 based on Foata normal form. 8/288 useless extension candidates. Maximal degree in co-relation 713. Up to 81 conditions per place. [2025-03-17 14:16:55,047 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 45 selfloop transitions, 17 changer transitions 0/68 dead transitions. [2025-03-17 14:16:55,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 412 flow [2025-03-17 14:16:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:16:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:16:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2025-03-17 14:16:55,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5630252100840336 [2025-03-17 14:16:55,049 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 153 flow. Second operand 7 states and 201 transitions. [2025-03-17 14:16:55,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 412 flow [2025-03-17 14:16:55,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 390 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 14:16:55,051 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 260 flow [2025-03-17 14:16:55,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-03-17 14:16:55,051 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-03-17 14:16:55,051 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 260 flow [2025-03-17 14:16:55,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-17 14:16:55,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:55,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:55,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:16:55,052 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-17 14:16:55,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1516130330, now seen corresponding path program 1 times [2025-03-17 14:16:55,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:55,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353026177] [2025-03-17 14:16:55,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:55,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:16:55,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:16:55,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:55,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:55,328 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-17 14:16:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353026177] [2025-03-17 14:16:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353026177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:55,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:55,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:16:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355947042] [2025-03-17 14:16:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:16:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:55,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:16:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:16:55,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-03-17 14:16:55,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 260 flow. Second operand has 10 states, 10 states have (on average 18.3) internal successors, (183), 10 states have internal predecessors, (183), 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-17 14:16:55,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:55,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-03-17 14:16:55,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:55,687 INFO L124 PetriNetUnfolderBase]: 106/292 cut-off events. [2025-03-17 14:16:55,687 INFO L125 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2025-03-17 14:16:55,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 292 events. 106/292 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1313 event pairs, 28 based on Foata normal form. 8/288 useless extension candidates. Maximal degree in co-relation 817. Up to 98 conditions per place. [2025-03-17 14:16:55,689 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 39 selfloop transitions, 21 changer transitions 0/66 dead transitions. [2025-03-17 14:16:55,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 446 flow [2025-03-17 14:16:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:16:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:16:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-03-17 14:16:55,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-17 14:16:55,690 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 260 flow. Second operand 9 states and 204 transitions. [2025-03-17 14:16:55,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 446 flow [2025-03-17 14:16:55,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:16:55,695 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 343 flow [2025-03-17 14:16:55,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=343, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-03-17 14:16:55,695 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2025-03-17 14:16:55,695 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 343 flow [2025-03-17 14:16:55,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.3) internal successors, (183), 10 states have internal predecessors, (183), 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-17 14:16:55,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:55,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:55,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:16:55,697 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-17 14:16:55,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1704425025, now seen corresponding path program 1 times [2025-03-17 14:16:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:55,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625871252] [2025-03-17 14:16:55,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:55,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:16:55,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:16:55,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:55,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:16:55,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:16:55,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:16:55,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:16:55,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:16:55,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:16:55,750 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:16:55,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-03-17 14:16:55,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-03-17 14:16:55,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-03-17 14:16:55,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-03-17 14:16:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-03-17 14:16:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-03-17 14:16:55,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-03-17 14:16:55,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-03-17 14:16:55,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-03-17 14:16:55,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-03-17 14:16:55,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-03-17 14:16:55,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-03-17 14:16:55,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:16:55,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:55,781 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:16:55,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:16:55,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:16:55 BasicIcfg [2025-03-17 14:16:55,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:16:55,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:16:55,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:16:55,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:16:55,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:51" (3/4) ... [2025-03-17 14:16:55,786 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:16:55,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:16:55,787 INFO L158 Benchmark]: Toolchain (without parser) took 5448.49ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 102.9MB in the beginning and 176.3MB in the end (delta: -73.4MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,787 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:55,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.92ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 65.1MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.17ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:55,788 INFO L158 Benchmark]: Boogie Preprocessor took 35.34ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:55,788 INFO L158 Benchmark]: IcfgBuilder took 567.53ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 72.0MB in the end (delta: -11.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,788 INFO L158 Benchmark]: TraceAbstraction took 4302.95ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 71.2MB in the beginning and 176.4MB in the end (delta: -105.2MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,788 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 352.3MB. Free memory was 176.4MB in the beginning and 176.3MB in the end (delta: 72.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,789 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.31ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.92ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 65.1MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.17ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.34ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 567.53ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 72.0MB in the end (delta: -11.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4302.95ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 71.2MB in the beginning and 176.4MB in the end (delta: -105.2MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 352.3MB. Free memory was 176.4MB in the beginning and 176.3MB in the end (delta: 72.1kB). Peak memory consumption was 8.4MB. 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.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1301 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 266 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2124 IncrementalHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 30 mSDtfsCounter, 2124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 801 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-17 14:16:55,808 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 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-?-8fc3dc6-m [2025-03-17 14:16:57,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:57,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:16:57,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:57,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:16:57,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:16:57,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:16:57,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:16:57,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:16:57,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:16:57,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:16:57,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:16:57,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:16:57,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:16:57,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:16:57,895 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:16:57,895 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:16:57,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:16:57,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:16:57,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:16:57,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:16:57,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:16:57,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:16:57,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:16:57,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:57,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:16:57,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:16:57,897 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:16:57,897 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:16:57,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:16:57,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:16:57,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:16:57,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:16:57,897 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-17 14:16:58,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:16:58,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:16:58,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:16:58,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:16:58,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:16:58,169 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-17 14:16:59,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea45295f5/8e501bb750bc4db5b5cc396091f32599/FLAG2c0fc0584 [2025-03-17 14:16:59,634 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:16:59,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-17 14:16:59,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea45295f5/8e501bb750bc4db5b5cc396091f32599/FLAG2c0fc0584 [2025-03-17 14:16:59,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea45295f5/8e501bb750bc4db5b5cc396091f32599 [2025-03-17 14:16:59,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:16:59,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:16:59,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:59,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:16:59,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:16:59,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:59" (1/1) ... [2025-03-17 14:16:59,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea90af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:59, skipping insertion in model container [2025-03-17 14:16:59,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:59" (1/1) ... [2025-03-17 14:17:00,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:17:00,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:00,312 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:17:00,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:00,437 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:17:00,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00 WrapperNode [2025-03-17 14:17:00,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:00,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:00,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:17:00,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:17:00,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,492 INFO L138 Inliner]: procedures = 369, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2025-03-17 14:17:00,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:00,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:17:00,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:17:00,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:17:00,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,527 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [12, 5]. 71 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [0, 5]. The 9 writes are split as follows [9, 0]. [2025-03-17 14:17:00,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:17:00,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:17:00,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:17:00,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:17:00,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:00,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:00,595 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-17 14:17:00,598 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-17 14:17:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 14:17:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 14:17:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:17:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:17:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:17:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:17:00,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:17:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:17:00,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:17:00,621 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:17:00,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:17:00,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:17:01,118 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:17:01,118 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:17:01,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:17:01,330 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:17:01,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:01 BoogieIcfgContainer [2025-03-17 14:17:01,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:17:01,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:17:01,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:17:01,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:17:01,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:16:59" (1/3) ... [2025-03-17 14:17:01,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5aeac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:01, skipping insertion in model container [2025-03-17 14:17:01,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00" (2/3) ... [2025-03-17 14:17:01,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5aeac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:01, skipping insertion in model container [2025-03-17 14:17:01,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:01" (3/3) ... [2025-03-17 14:17:01,339 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-03-17 14:17:01,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:17:01,349 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-17 14:17:01,349 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:17:01,406 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:17:01,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-03-17 14:17:01,462 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 14:17:01,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:01,470 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-17 14:17:01,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-03-17 14:17:01,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-03-17 14:17:01,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:17:01,488 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;@716a0589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:17:01,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-17 14:17:01,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:17:01,494 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-17 14:17:01,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:01,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:01,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:17:01,496 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-17 14:17:01,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash 11523, now seen corresponding path program 1 times [2025-03-17 14:17:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:01,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647534431] [2025-03-17 14:17:01,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:01,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:01,513 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-17 14:17:01,514 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-17 14:17:01,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:17:01,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:17:01,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:01,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:01,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:17:01,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:01,665 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-17 14:17:01,679 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-17 14:17:01,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:01,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647534431] [2025-03-17 14:17:01,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647534431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:01,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:01,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:17:01,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629555281] [2025-03-17 14:17:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:01,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:01,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:01,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:01,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-03-17 14:17:01,801 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-17 14:17:01,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:01,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-03-17 14:17:01,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:01,915 INFO L124 PetriNetUnfolderBase]: 42/172 cut-off events. [2025-03-17 14:17:01,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:01,918 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 750 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-17 14:17:01,920 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-17 14:17:01,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-03-17 14:17:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-17 14:17:01,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-03-17 14:17:01,932 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-03-17 14:17:01,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-03-17 14:17:01,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:01,937 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-03-17 14:17:01,939 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-17 14:17:01,941 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-17 14:17:01,941 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-03-17 14:17:01,942 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-17 14:17:01,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:01,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:17:01,948 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-17 14:17:02,145 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-17 14:17:02,145 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-17 14:17:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 11524, now seen corresponding path program 1 times [2025-03-17 14:17:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711641389] [2025-03-17 14:17:02,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:02,149 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-17 14:17:02,149 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-17 14:17:02,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:17:02,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:17:02,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:02,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:02,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:17:02,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:02,274 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-17 14:17:02,284 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-17 14:17:02,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:02,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711641389] [2025-03-17 14:17:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711641389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:17:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122550436] [2025-03-17 14:17:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:02,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:02,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:02,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:02,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:02,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-17 14:17:02,377 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-17 14:17:02,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:02,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-17 14:17:02,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:02,470 INFO L124 PetriNetUnfolderBase]: 42/168 cut-off events. [2025-03-17 14:17:02,470 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:17:02,471 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 742 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-17 14:17:02,472 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-17 14:17:02,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-03-17 14:17:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-17 14:17:02,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-03-17 14:17:02,473 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-03-17 14:17:02,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-03-17 14:17:02,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:02,474 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-03-17 14:17:02,474 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-17 14:17:02,475 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-03-17 14:17:02,475 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-03-17 14:17:02,475 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-17 14:17:02,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:02,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:17:02,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:17:02,675 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-17 14:17:02,676 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-17 14:17:02,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2061536470, now seen corresponding path program 1 times [2025-03-17 14:17:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087541632] [2025-03-17 14:17:02,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:02,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:02,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:02,679 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-17 14:17:02,680 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-17 14:17:02,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:17:02,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:17:02,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:02,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:17:02,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:02,825 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-17 14:17:02,834 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-17 14:17:02,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:02,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087541632] [2025-03-17 14:17:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087541632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:02,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138048531] [2025-03-17 14:17:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:02,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:02,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:02,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:02,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2025-03-17 14:17:02,915 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-17 14:17:02,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:02,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2025-03-17 14:17:02,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,001 INFO L124 PetriNetUnfolderBase]: 49/174 cut-off events. [2025-03-17 14:17:03,003 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:17:03,004 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 733 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-17 14:17:03,005 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-03-17 14:17:03,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 120 flow [2025-03-17 14:17:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-17 14:17:03,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6993464052287581 [2025-03-17 14:17:03,008 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 107 transitions. [2025-03-17 14:17:03,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 120 flow [2025-03-17 14:17:03,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:03,009 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 80 flow [2025-03-17 14:17:03,010 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-17 14:17:03,011 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-03-17 14:17:03,011 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 80 flow [2025-03-17 14:17:03,011 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-17 14:17:03,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:17:03,019 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-17 14:17:03,216 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-17 14:17:03,216 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-17 14:17:03,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2061536471, now seen corresponding path program 1 times [2025-03-17 14:17:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214714391] [2025-03-17 14:17:03,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:03,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:03,219 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-17 14:17:03,219 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-17 14:17:03,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:17:03,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:17:03,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:03,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:17:03,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:03,324 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-17 14:17:03,341 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-17 14:17:03,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:03,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214714391] [2025-03-17 14:17:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214714391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:03,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:03,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:03,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636088295] [2025-03-17 14:17:03,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:03,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:03,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:03,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:03,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-03-17 14:17:03,415 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-17 14:17:03,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-03-17 14:17:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,484 INFO L124 PetriNetUnfolderBase]: 42/144 cut-off events. [2025-03-17 14:17:03,485 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:17:03,485 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 543 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-17 14:17:03,486 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 17 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-03-17 14:17:03,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 108 flow [2025-03-17 14:17:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-17 14:17:03,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-03-17 14:17:03,487 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 80 flow. Second operand 3 states and 109 transitions. [2025-03-17 14:17:03,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 108 flow [2025-03-17 14:17:03,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:03,488 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 73 flow [2025-03-17 14:17:03,488 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-17 14:17:03,488 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-03-17 14:17:03,488 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 73 flow [2025-03-17 14:17:03,489 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-17 14:17:03,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:03,495 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-17 14:17:03,693 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-17 14:17:03,693 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-17 14:17:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1496039581, now seen corresponding path program 1 times [2025-03-17 14:17:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:03,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508233044] [2025-03-17 14:17:03,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:03,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:03,697 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-17 14:17:03,697 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-17 14:17:03,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:17:03,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:17:03,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:03,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:17:03,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:03,805 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-17 14:17:03,809 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-17 14:17:03,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:03,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508233044] [2025-03-17 14:17:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508233044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:03,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:03,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905189426] [2025-03-17 14:17:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:03,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:03,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:03,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:03,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-03-17 14:17:03,865 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-17 14:17:03,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-03-17 14:17:03,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,970 INFO L124 PetriNetUnfolderBase]: 49/166 cut-off events. [2025-03-17 14:17:03,970 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:17:03,970 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 687 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-17 14:17:03,971 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-17 14:17:03,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 135 flow [2025-03-17 14:17:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-17 14:17:03,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-03-17 14:17:03,974 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 73 flow. Second operand 3 states and 118 transitions. [2025-03-17 14:17:03,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 135 flow [2025-03-17 14:17:03,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:03,975 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-03-17 14:17:03,975 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-17 14:17:03,975 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-03-17 14:17:03,975 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-03-17 14:17:03,976 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-17 14:17:03,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:03,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:17:04,176 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-17 14:17:04,176 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-17 14:17:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1496039582, now seen corresponding path program 1 times [2025-03-17 14:17:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889271909] [2025-03-17 14:17:04,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:04,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:04,179 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-17 14:17:04,180 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-17 14:17:04,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:17:04,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:17:04,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:17:04,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:04,296 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-17 14:17:04,302 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-17 14:17:04,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:04,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:04,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889271909] [2025-03-17 14:17:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889271909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:04,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134881323] [2025-03-17 14:17:04,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:04,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:04,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:04,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-03-17 14:17:04,376 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-17 14:17:04,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:04,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-03-17 14:17:04,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:04,461 INFO L124 PetriNetUnfolderBase]: 42/143 cut-off events. [2025-03-17 14:17:04,461 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 14:17:04,462 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 536 event pairs, 35 based on Foata normal form. 16/146 useless extension candidates. Maximal degree in co-relation 258. Up to 88 conditions per place. [2025-03-17 14:17:04,462 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-17 14:17:04,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-03-17 14:17:04,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-17 14:17:04,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-03-17 14:17:04,463 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-03-17 14:17:04,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-03-17 14:17:04,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:04,464 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-03-17 14:17:04,464 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-17 14:17:04,465 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-03-17 14:17:04,465 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-03-17 14:17:04,465 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-17 14:17:04,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:04,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:04,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:04,665 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-17 14:17:04,666 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-17 14:17:04,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash -400005061, now seen corresponding path program 1 times [2025-03-17 14:17:04,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:04,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2032555660] [2025-03-17 14:17:04,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:04,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:04,679 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-17 14:17:04,680 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-17 14:17:04,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:17:04,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:17:04,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:17:04,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:04,836 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-03-17 14:17:04,836 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-17 14:17:04,895 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-17 14:17:04,953 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-17 14:17:04,969 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-17 14:17:04,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:04,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:04,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032555660] [2025-03-17 14:17:04,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032555660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:17:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725977760] [2025-03-17 14:17:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:04,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:04,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:05,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-17 14:17:05,348 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-17 14:17:05,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-17 14:17:05,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:05,603 INFO L124 PetriNetUnfolderBase]: 98/267 cut-off events. [2025-03-17 14:17:05,603 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-17 14:17:05,604 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 1160 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-17 14:17:05,605 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 38 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2025-03-17 14:17:05,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 230 flow [2025-03-17 14:17:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 237 transitions. [2025-03-17 14:17:05,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5808823529411765 [2025-03-17 14:17:05,608 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 8 states and 237 transitions. [2025-03-17 14:17:05,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 230 flow [2025-03-17 14:17:05,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:05,611 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 136 flow [2025-03-17 14:17:05,611 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=8, PETRI_FLOW=136, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-03-17 14:17:05,612 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2025-03-17 14:17:05,612 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 136 flow [2025-03-17 14:17:05,613 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-17 14:17:05,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:05,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:05,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:17:05,813 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-17 14:17:05,813 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-17 14:17:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -400005060, now seen corresponding path program 1 times [2025-03-17 14:17:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657997655] [2025-03-17 14:17:05,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:05,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:05,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:05,817 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-17 14:17:05,817 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-17 14:17:05,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:17:05,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:17:05,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:05,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:17:05,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:05,939 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-17 14:17:05,964 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 14:17:05,964 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-17 14:17:06,007 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-17 14:17:06,013 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-17 14:17:06,071 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-17 14:17:06,075 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-17 14:17:06,083 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-17 14:17:06,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:06,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:06,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657997655] [2025-03-17 14:17:06,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657997655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:06,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:06,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136523285] [2025-03-17 14:17:06,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:06,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:06,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:06,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:06,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:06,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-03-17 14:17:06,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 136 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-17 14:17:06,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:06,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-03-17 14:17:06,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:06,459 INFO L124 PetriNetUnfolderBase]: 110/298 cut-off events. [2025-03-17 14:17:06,459 INFO L125 PetriNetUnfolderBase]: For 121/123 co-relation queries the response was YES. [2025-03-17 14:17:06,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 298 events. 110/298 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1371 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-17 14:17:06,460 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 39 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2025-03-17 14:17:06,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 272 flow [2025-03-17 14:17:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:17:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:17:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2025-03-17 14:17:06,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797385620915033 [2025-03-17 14:17:06,462 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 136 flow. Second operand 6 states and 208 transitions. [2025-03-17 14:17:06,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 272 flow [2025-03-17 14:17:06,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:06,463 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 168 flow [2025-03-17 14:17:06,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=132, 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=168, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-03-17 14:17:06,464 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-17 14:17:06,464 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 168 flow [2025-03-17 14:17:06,464 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-17 14:17:06,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:06,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:06,472 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-17 14:17:06,670 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-17 14:17:06,670 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-17 14:17:06,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 521606477, now seen corresponding path program 1 times [2025-03-17 14:17:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521311475] [2025-03-17 14:17:06,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:06,673 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-17 14:17:06,674 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-17 14:17:06,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:17:06,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:17:06,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:06,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:06,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 14:17:06,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:06,804 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-17 14:17:06,854 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-03-17 14:17:06,854 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-17 14:17:06,868 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 14:17:06,869 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-17 14:17:06,960 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-17 14:17:06,970 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-17 14:17:07,035 INFO L349 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2025-03-17 14:17:07,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 14:17:07,048 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-03-17 14:17:07,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2025-03-17 14:17:07,127 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-17 14:17:07,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:17:07,170 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-17 14:17:07,173 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-17 14:17:07,205 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-17 14:17:07,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:07,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521311475] [2025-03-17 14:17:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521311475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:07,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:07,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:17:07,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146642656] [2025-03-17 14:17:07,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:07,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:17:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:07,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:17:07,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:17:07,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-03-17 14:17:07,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 168 flow. Second operand has 10 states, 10 states have (on average 21.3) internal successors, (213), 10 states have internal predecessors, (213), 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-17 14:17:07,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:07,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-03-17 14:17:07,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:08,348 INFO L124 PetriNetUnfolderBase]: 121/327 cut-off events. [2025-03-17 14:17:08,348 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-03-17 14:17:08,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 327 events. 121/327 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1529 event pairs, 28 based on Foata normal form. 16/332 useless extension candidates. Maximal degree in co-relation 832. Up to 97 conditions per place. [2025-03-17 14:17:08,350 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 44 selfloop transitions, 22 changer transitions 0/71 dead transitions. [2025-03-17 14:17:08,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 440 flow [2025-03-17 14:17:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:17:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:17:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2025-03-17 14:17:08,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-17 14:17:08,353 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 168 flow. Second operand 9 states and 238 transitions. [2025-03-17 14:17:08,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 440 flow [2025-03-17 14:17:08,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 423 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:08,355 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 303 flow [2025-03-17 14:17:08,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=157, 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=303, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-03-17 14:17:08,357 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2025-03-17 14:17:08,357 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 303 flow [2025-03-17 14:17:08,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.3) internal successors, (213), 10 states have internal predecessors, (213), 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-17 14:17:08,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:08,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:08,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:08,558 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-17 14:17:08,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 14:17:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash -378268444, now seen corresponding path program 1 times [2025-03-17 14:17:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775550677] [2025-03-17 14:17:08,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:08,560 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-17 14:17:08,561 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-17 14:17:08,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:08,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:08,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:08,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:17:08,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:08,681 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-17 14:17:08,693 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-17 14:17:08,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:08,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:17:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775550677] [2025-03-17 14:17:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775550677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:08,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:08,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:08,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794667210] [2025-03-17 14:17:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:08,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:17:08,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:08,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:08,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-03-17 14:17:08,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:08,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:08,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-03-17 14:17:08,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:08,830 INFO L124 PetriNetUnfolderBase]: 104/288 cut-off events. [2025-03-17 14:17:08,830 INFO L125 PetriNetUnfolderBase]: For 414/416 co-relation queries the response was YES. [2025-03-17 14:17:08,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 288 events. 104/288 cut-off events. For 414/416 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1317 event pairs, 43 based on Foata normal form. 2/289 useless extension candidates. Maximal degree in co-relation 867. Up to 218 conditions per place. [2025-03-17 14:17:08,834 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-03-17 14:17:08,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 399 flow [2025-03-17 14:17:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-17 14:17:08,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-03-17 14:17:08,835 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 303 flow. Second operand 3 states and 120 transitions. [2025-03-17 14:17:08,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 399 flow [2025-03-17 14:17:08,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:08,838 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 301 flow [2025-03-17 14:17:08,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-03-17 14:17:08,838 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-03-17 14:17:08,838 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 301 flow [2025-03-17 14:17:08,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:08,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:08,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:08,847 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-17 14:17:09,040 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-17 14:17:09,041 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-17 14:17:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1983844353, now seen corresponding path program 1 times [2025-03-17 14:17:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:17:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261642071] [2025-03-17 14:17:09,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:09,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:09,043 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-17 14:17:09,044 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-17 14:17:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:09,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:09,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:17:09,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:17:09,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:09,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:09,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:17:09,799 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:17:09,799 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:17:09,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-03-17 14:17:09,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-03-17 14:17:09,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-03-17 14:17:09,813 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-17 14:17:10,007 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-17 14:17:10,007 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:10,037 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:17:10,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:17:10,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:17:10 BasicIcfg [2025-03-17 14:17:10,041 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:17:10,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:17:10,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:17:10,041 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:17:10,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:01" (3/4) ... [2025-03-17 14:17:10,043 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:17:10,044 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:17:10,045 INFO L158 Benchmark]: Toolchain (without parser) took 10065.73ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 90.6MB in the beginning and 99.7MB in the end (delta: -9.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-17 14:17:10,045 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:10,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.31ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 51.5MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 14:17:10,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 117.4MB. Free memory was 51.5MB in the beginning and 49.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:10,045 INFO L158 Benchmark]: Boogie Preprocessor took 62.08ms. Allocated memory is still 117.4MB. Free memory was 48.7MB in the beginning and 46.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:10,045 INFO L158 Benchmark]: IcfgBuilder took 774.30ms. Allocated memory is still 117.4MB. Free memory was 45.9MB in the beginning and 73.8MB in the end (delta: -27.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2025-03-17 14:17:10,046 INFO L158 Benchmark]: TraceAbstraction took 8707.74ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 73.1MB in the beginning and 101.2MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:10,046 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:17:10,047 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.26ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.31ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 51.5MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 117.4MB. Free memory was 51.5MB in the beginning and 49.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.08ms. Allocated memory is still 117.4MB. Free memory was 48.7MB in the beginning and 46.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 774.30ms. Allocated memory is still 117.4MB. Free memory was 45.9MB in the beginning and 73.8MB in the end (delta: -27.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8707.74ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 73.1MB in the beginning and 101.2MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). 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=0] [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=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: 8.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 996 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1974 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 93 mSDtfsCounter, 1974 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=9, InterpolantAutomatonStates: 44, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 77 ConstructedInterpolants, 1 QuantifiedInterpolants, 911 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1435 ConjunctsInSsa, 94 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-17 14:17:10,062 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample