./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_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 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:27,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:27,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:13:27,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:27,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:27,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:27,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:27,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:27,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:27,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:27,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:27,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:27,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:27,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:27,730 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:27,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:27,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:27,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:27,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:27,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:27,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:27,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:27,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:27,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:27,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:27,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:27,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:27,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:27,732 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 -> 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 [2025-03-09 01:13:27,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:27,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:27,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:27,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:27,991 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:27,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-03-09 01:13:29,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f220dbb44/358b3ce4eddc48949d6a621328bf2d17/FLAGa54d666d8 [2025-03-09 01:13:29,340 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:29,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-03-09 01:13:29,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f220dbb44/358b3ce4eddc48949d6a621328bf2d17/FLAGa54d666d8 [2025-03-09 01:13:29,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f220dbb44/358b3ce4eddc48949d6a621328bf2d17 [2025-03-09 01:13:29,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:29,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:29,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:29,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:29,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:29,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:29,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29, skipping insertion in model container [2025-03-09 01:13:29,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:29,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:29,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:29,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:29,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:29,972 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:29,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29 WrapperNode [2025-03-09 01:13:29,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:29,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:29,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:29,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:29,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:29,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,002 INFO L138 Inliner]: procedures = 162, calls = 77, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 106 [2025-03-09 01:13:30,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:30,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:30,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:30,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:30,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,022 INFO L175 MemorySlicer]: Split 66 memory accesses to 2 slices as follows [16, 50]. 76 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [10, 50]. The 3 writes are split as follows [3, 0]. [2025-03-09 01:13:30,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:30,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:30,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:30,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:30,044 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (1/1) ... [2025-03-09 01:13:30,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:30,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:13:30,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:13:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:13:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:30,101 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:30,208 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:30,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:30,467 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:30,467 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:30,711 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:30,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:30,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:30 BoogieIcfgContainer [2025-03-09 01:13:30,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:30,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:30,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:30,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:30,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:29" (1/3) ... [2025-03-09 01:13:30,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3959fbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:30, skipping insertion in model container [2025-03-09 01:13:30,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:29" (2/3) ... [2025-03-09 01:13:30,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3959fbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:30, skipping insertion in model container [2025-03-09 01:13:30,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:30" (3/3) ... [2025-03-09 01:13:30,721 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_23-idxsense_nr.i [2025-03-09 01:13:30,731 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:30,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_23-idxsense_nr.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 13 error locations. [2025-03-09 01:13:30,733 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:30,766 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:30,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 82 flow [2025-03-09 01:13:30,816 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2025-03-09 01:13:30,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:30,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 3. Up to 2 conditions per place. [2025-03-09 01:13:30,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 82 flow [2025-03-09 01:13:30,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 79 flow [2025-03-09 01:13:30,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:30,841 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;@1458577d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:30,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-09 01:13:30,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:30,849 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-03-09 01:13:30,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:30,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:30,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:30,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:13:30,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:30,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1867828485, now seen corresponding path program 1 times [2025-03-09 01:13:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-09 01:13:30,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:30,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:13:30,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:13:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:31,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-09 01:13:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948944698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:31,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:31,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201597635] [2025-03-09 01:13:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:31,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:31,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:31,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:31,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2025-03-09 01:13:31,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:31,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2025-03-09 01:13:31,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:31,194 INFO L124 PetriNetUnfolderBase]: 56/182 cut-off events. [2025-03-09 01:13:31,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:31,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 182 events. 56/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 722 event pairs, 55 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 303. Up to 131 conditions per place. [2025-03-09 01:13:31,199 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 19 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-09 01:13:31,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 123 flow [2025-03-09 01:13:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-09 01:13:31,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2025-03-09 01:13:31,211 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 79 flow. Second operand 3 states and 79 transitions. [2025-03-09 01:13:31,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 123 flow [2025-03-09 01:13:31,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:31,218 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 90 flow [2025-03-09 01:13:31,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-03-09 01:13:31,223 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-03-09 01:13:31,224 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 90 flow [2025-03-09 01:13:31,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:31,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:31,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:13:31,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash 920786176, now seen corresponding path program 1 times [2025-03-09 01:13:31,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:31,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-09 01:13:31,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:31,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:31,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:13:31,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:13:31,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:31,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-09 01:13:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38001881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143104084] [2025-03-09 01:13:31,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:31,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:31,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:31,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:31,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:13:31,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:13:31,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:13:31,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:31,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:13:31,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:31,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143104084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:31,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:13:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171715896] [2025-03-09 01:13:31,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:31,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:31,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:31,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:31,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2025-03-09 01:13:31,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:31,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2025-03-09 01:13:31,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:31,568 INFO L124 PetriNetUnfolderBase]: 56/185 cut-off events. [2025-03-09 01:13:31,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:31,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 185 events. 56/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 722 event pairs, 55 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 322. Up to 131 conditions per place. [2025-03-09 01:13:31,572 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 19 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2025-03-09 01:13:31,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 150 flow [2025-03-09 01:13:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2025-03-09 01:13:31,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2025-03-09 01:13:31,575 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 90 flow. Second operand 6 states and 141 transitions. [2025-03-09 01:13:31,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 150 flow [2025-03-09 01:13:31,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 146 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:31,576 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 122 flow [2025-03-09 01:13:31,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-03-09 01:13:31,576 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-03-09 01:13:31,577 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 122 flow [2025-03-09 01:13:31,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:31,577 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:31,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:13:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:31,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:13:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash 695959541, now seen corresponding path program 2 times [2025-03-09 01:13:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-03-09 01:13:31,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:31,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:13:31,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-03-09 01:13:31,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:31,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:13:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:31,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-03-09 01:13:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569548551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:31,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662871809] [2025-03-09 01:13:31,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:31,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:31,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:31,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:31,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2025-03-09 01:13:31,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:31,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2025-03-09 01:13:31,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:31,974 INFO L124 PetriNetUnfolderBase]: 56/169 cut-off events. [2025-03-09 01:13:31,974 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:13:31,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 169 events. 56/169 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 612 event pairs, 55 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 297. Up to 134 conditions per place. [2025-03-09 01:13:31,975 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 23 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2025-03-09 01:13:31,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 158 flow [2025-03-09 01:13:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-09 01:13:31,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 01:13:31,978 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 122 flow. Second operand 3 states and 65 transitions. [2025-03-09 01:13:31,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 158 flow [2025-03-09 01:13:31,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 144 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:31,979 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 98 flow [2025-03-09 01:13:31,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-09 01:13:31,980 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2025-03-09 01:13:31,980 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 98 flow [2025-03-09 01:13:31,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:31,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:31,980 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:31,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:13:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash 695959542, now seen corresponding path program 1 times [2025-03-09 01:13:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324767857] [2025-03-09 01:13:31,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:31,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:13:32,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:13:32,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:32,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324767857] [2025-03-09 01:13:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324767857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:32,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318288370] [2025-03-09 01:13:32,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:32,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:32,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:32,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:13:32,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:13:32,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:13:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:13:32,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:32,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318288370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:32,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:13:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361337861] [2025-03-09 01:13:32,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:32,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:13:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:32,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:13:32,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:13:32,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2025-03-09 01:13:32,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 98 flow. Second operand has 13 states, 13 states have (on average 20.307692307692307) internal successors, (264), 13 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:32,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2025-03-09 01:13:32,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,318 INFO L124 PetriNetUnfolderBase]: 56/175 cut-off events. [2025-03-09 01:13:32,318 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-09 01:13:32,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 175 events. 56/175 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 612 event pairs, 55 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 337. Up to 131 conditions per place. [2025-03-09 01:13:32,319 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 19 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2025-03-09 01:13:32,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 42 transitions, 194 flow [2025-03-09 01:13:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:13:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:13:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 264 transitions. [2025-03-09 01:13:32,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2025-03-09 01:13:32,321 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 98 flow. Second operand 12 states and 264 transitions. [2025-03-09 01:13:32,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 42 transitions, 194 flow [2025-03-09 01:13:32,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:32,322 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 181 flow [2025-03-09 01:13:32,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-03-09 01:13:32,323 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-03-09 01:13:32,323 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 181 flow [2025-03-09 01:13:32,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.307692307692307) internal successors, (264), 13 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:32,323 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:32,329 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-09 01:13:32,524 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,SelfDestructingSolverStorable3 [2025-03-09 01:13:32,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:13:32,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2053516266, now seen corresponding path program 2 times [2025-03-09 01:13:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:32,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875330879] [2025-03-09 01:13:32,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:32,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:13:32,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 17 statements. [2025-03-09 01:13:32,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:32,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:32,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:32,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875330879] [2025-03-09 01:13:32,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875330879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:32,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:32,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:32,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104775278] [2025-03-09 01:13:32,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:32,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:32,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:32,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:32,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2025-03-09 01:13:32,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:32,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2025-03-09 01:13:32,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,677 INFO L124 PetriNetUnfolderBase]: 56/159 cut-off events. [2025-03-09 01:13:32,677 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-09 01:13:32,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 159 events. 56/159 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 499 event pairs, 55 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 344. Up to 140 conditions per place. [2025-03-09 01:13:32,678 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-09 01:13:32,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 36 transitions, 229 flow [2025-03-09 01:13:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-09 01:13:32,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 01:13:32,679 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 181 flow. Second operand 3 states and 65 transitions. [2025-03-09 01:13:32,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 36 transitions, 229 flow [2025-03-09 01:13:32,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 36 transitions, 181 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-09 01:13:32,684 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 121 flow [2025-03-09 01:13:32,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-03-09 01:13:32,685 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-03-09 01:13:32,685 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 121 flow [2025-03-09 01:13:32,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:32,685 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:32,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:13:32,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:13:32,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:32,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1313025380, now seen corresponding path program 1 times [2025-03-09 01:13:32,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:32,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964588489] [2025-03-09 01:13:32,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:32,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:13:32,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:13:32,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:32,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964588489] [2025-03-09 01:13:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964588489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355369288] [2025-03-09 01:13:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:32,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:32,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:32,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2025-03-09 01:13:32,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:32,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2025-03-09 01:13:32,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:32,813 INFO L124 PetriNetUnfolderBase]: 51/142 cut-off events. [2025-03-09 01:13:32,816 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 01:13:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 142 events. 51/142 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 428 event pairs, 50 based on Foata normal form. 6/144 useless extension candidates. Maximal degree in co-relation 293. Up to 129 conditions per place. [2025-03-09 01:13:32,817 INFO L140 encePairwiseOnDemand]: 37/39 looper letters, 0 selfloop transitions, 0 changer transitions 34/34 dead transitions. [2025-03-09 01:13:32,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 34 transitions, 177 flow [2025-03-09 01:13:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-09 01:13:32,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6324786324786325 [2025-03-09 01:13:32,818 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 121 flow. Second operand 3 states and 74 transitions. [2025-03-09 01:13:32,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 34 transitions, 177 flow [2025-03-09 01:13:32,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 34 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:32,819 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-03-09 01:13:32,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-03-09 01:13:32,820 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-03-09 01:13:32,820 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-03-09 01:13:32,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:32,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-03-09 01:13:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-03-09 01:13:32,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-03-09 01:13:32,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-03-09 01:13:32,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-03-09 01:13:32,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-03-09 01:13:32,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-03-09 01:13:32,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-03-09 01:13:32,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-03-09 01:13:32,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:13:32,828 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-09 01:13:32,831 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:13:32,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:13:32,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:13:32 BasicIcfg [2025-03-09 01:13:32,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:13:32,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:13:32,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:13:32,839 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:13:32,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:30" (3/4) ... [2025-03-09 01:13:32,841 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:13:32,843 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-09 01:13:32,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2025-03-09 01:13:32,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-09 01:13:32,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 01:13:32,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 01:13:32,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:13:32,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:13:32,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:13:32,909 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:13:32,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:13:32,910 INFO L158 Benchmark]: Toolchain (without parser) took 3239.73ms. Allocated memory is still 201.3MB. Free memory was 152.5MB in the beginning and 147.4MB in the end (delta: 5.1MB). Peak memory consumption was 958.6kB. Max. memory is 16.1GB. [2025-03-09 01:13:32,910 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:32,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.11ms. Allocated memory is still 201.3MB. Free memory was 152.1MB in the beginning and 131.1MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:13:32,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.92ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 129.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:32,911 INFO L158 Benchmark]: Boogie Preprocessor took 39.61ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 127.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:32,911 INFO L158 Benchmark]: IcfgBuilder took 669.49ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 142.3MB in the end (delta: -15.3MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2025-03-09 01:13:32,911 INFO L158 Benchmark]: TraceAbstraction took 2124.51ms. Allocated memory is still 201.3MB. Free memory was 141.2MB in the beginning and 154.1MB in the end (delta: -12.9MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2025-03-09 01:13:32,911 INFO L158 Benchmark]: Witness Printer took 69.97ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 147.4MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:32,912 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.24ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.11ms. Allocated memory is still 201.3MB. Free memory was 152.1MB in the beginning and 131.1MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.92ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 129.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.61ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 127.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 669.49ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 142.3MB in the end (delta: -15.3MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2124.51ms. Allocated memory is still 201.3MB. Free memory was 141.2MB in the beginning and 154.1MB in the end (delta: -12.9MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 69.97ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 147.4MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 687]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 52 locations, 51 edges, 18 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: 2.0s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 20 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=4, InterpolantAutomatonStates: 30, 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, 0.6s InterpolantComputationTime, 100 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 120/153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:13:32,929 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: TRUE