./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.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/06-symbeq_08-tricky_address3.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 a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:16:44,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:44,627 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:44,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:44,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:16:44,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:16:44,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:16:44,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:16:44,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:16:44,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:16:44,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:16:44,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:16:44,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:16:44,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:16:44,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:16:44,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:16:44,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:16:44,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:44,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:16:44,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:16:44,659 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 -> a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb [2025-03-17 14:16:44,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:16:44,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:16:44,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:16:44,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:16:44,856 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:16:44,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-03-17 14:16:45,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fdd4ca31/995ae91a59104f4d8ea22bf70b3a64e0/FLAG378c8eeb9 [2025-03-17 14:16:46,245 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:16:46,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-03-17 14:16:46,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fdd4ca31/995ae91a59104f4d8ea22bf70b3a64e0/FLAG378c8eeb9 [2025-03-17 14:16:46,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fdd4ca31/995ae91a59104f4d8ea22bf70b3a64e0 [2025-03-17 14:16:46,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:16:46,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:16:46,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:46,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:16:46,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:16:46,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:46" (1/1) ... [2025-03-17 14:16:46,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5770b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:46, skipping insertion in model container [2025-03-17 14:16:46,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:46" (1/1) ... [2025-03-17 14:16:46,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:16:46,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:46,876 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:16:46,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:46,980 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:16:46,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:46 WrapperNode [2025-03-17 14:16:46,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:46,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:46,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:16:46,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:16:46,986 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:46" (1/1) ... [2025-03-17 14:16:46,997 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:46" (1/1) ... [2025-03-17 14:16:47,020 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 127 [2025-03-17 14:16:47,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:47,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:16:47,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:16:47,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:16:47,027 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:46" (1/1) ... [2025-03-17 14:16:47,028 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:46" (1/1) ... [2025-03-17 14:16:47,031 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:46" (1/1) ... [2025-03-17 14:16:47,040 INFO L175 MemorySlicer]: Split 64 memory accesses to 1 slices as follows [64]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 2 writes are split as follows [2]. [2025-03-17 14:16:47,041 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:46" (1/1) ... [2025-03-17 14:16:47,041 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:46" (1/1) ... [2025-03-17 14:16:47,045 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:46" (1/1) ... [2025-03-17 14:16:47,046 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:46" (1/1) ... [2025-03-17 14:16:47,047 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:46" (1/1) ... [2025-03-17 14:16:47,047 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:46" (1/1) ... [2025-03-17 14:16:47,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:16:47,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:16:47,049 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:16:47,049 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:16:47,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:46" (1/1) ... [2025-03-17 14:16:47,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:47,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:47,075 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:47,078 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:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:16:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:16:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:16:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:16:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:16:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:16:47,093 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:16:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:16:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:16:47,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:16:47,094 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:47,187 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:16:47,189 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:16:47,389 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:16:47,389 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:16:47,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:16:47,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:16:47,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:47 BoogieIcfgContainer [2025-03-17 14:16:47,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:16:47,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:16:47,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:16:47,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:16:47,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:16:46" (1/3) ... [2025-03-17 14:16:47,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a0ae4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:47, skipping insertion in model container [2025-03-17 14:16:47,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:46" (2/3) ... [2025-03-17 14:16:47,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a0ae4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:47, skipping insertion in model container [2025-03-17 14:16:47,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:47" (3/3) ... [2025-03-17 14:16:47,664 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2025-03-17 14:16:47,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:16:47,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_08-tricky_address3.i that has 2 procedures, 29 locations, 1 initial locations, 1 loop locations, and 9 error locations. [2025-03-17 14:16:47,675 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:16:47,722 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:16:47,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 62 flow [2025-03-17 14:16:47,772 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-03-17 14:16:47,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:47,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 3. Up to 2 conditions per place. [2025-03-17 14:16:47,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 62 flow [2025-03-17 14:16:47,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 59 flow [2025-03-17 14:16:47,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:16:47,805 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;@1e309847, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:16:47,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 14:16:47,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:16:47,811 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-03-17 14:16:47,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:47,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:47,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:47,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:47,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash -795894589, now seen corresponding path program 1 times [2025-03-17 14:16:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:47,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501690064] [2025-03-17 14:16:47,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:47,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:16:47,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:16:47,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:47,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:48,060 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:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501690064] [2025-03-17 14:16:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501690064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:48,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631984773] [2025-03-17 14:16:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:48,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:48,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:48,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:48,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2025-03-17 14:16:48,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:48,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:48,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2025-03-17 14:16:48,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:48,173 INFO L124 PetriNetUnfolderBase]: 50/150 cut-off events. [2025-03-17 14:16:48,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 150 events. 50/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 563 event pairs, 49 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 257. Up to 117 conditions per place. [2025-03-17 14:16:48,177 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-17 14:16:48,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 99 flow [2025-03-17 14:16:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-17 14:16:48,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-03-17 14:16:48,189 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 59 flow. Second operand 3 states and 53 transitions. [2025-03-17 14:16:48,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 99 flow [2025-03-17 14:16:48,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:48,195 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 70 flow [2025-03-17 14:16:48,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-03-17 14:16:48,199 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-03-17 14:16:48,200 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 70 flow [2025-03-17 14:16:48,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:48,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:48,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:48,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:16:48,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:48,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -495184967, now seen corresponding path program 1 times [2025-03-17 14:16:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195787821] [2025-03-17 14:16:48,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:48,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:16:48,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:16:48,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:48,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:48,263 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-17 14:16:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195787821] [2025-03-17 14:16:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195787821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780113618] [2025-03-17 14:16:48,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:48,273 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:16:48,275 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:16:48,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:16:48,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:16:48,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:48,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:48,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:16:48,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:48,392 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-17 14:16:48,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:48,414 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-17 14:16:48,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780113618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:48,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:16:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888571059] [2025-03-17 14:16:48,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:48,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:16:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:48,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:16:48,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:16:48,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2025-03-17 14:16:48,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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:16:48,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:48,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2025-03-17 14:16:48,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:48,496 INFO L124 PetriNetUnfolderBase]: 50/153 cut-off events. [2025-03-17 14:16:48,497 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:48,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 153 events. 50/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 563 event pairs, 49 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 276. Up to 117 conditions per place. [2025-03-17 14:16:48,498 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 17 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2025-03-17 14:16:48,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 126 flow [2025-03-17 14:16:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:16:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:16:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-03-17 14:16:48,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2025-03-17 14:16:48,499 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 70 flow. Second operand 6 states and 91 transitions. [2025-03-17 14:16:48,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 126 flow [2025-03-17 14:16:48,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 122 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:48,500 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 102 flow [2025-03-17 14:16:48,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-17 14:16:48,501 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-03-17 14:16:48,501 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 102 flow [2025-03-17 14:16:48,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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:16:48,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:48,501 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:48,508 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-17 14:16:48,701 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-17 14:16:48,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:48,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1366783453, now seen corresponding path program 2 times [2025-03-17 14:16:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175638608] [2025-03-17 14:16:48,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:48,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:16:48,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-03-17 14:16:48,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:16:48,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:48,849 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-17 14:16:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175638608] [2025-03-17 14:16:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175638608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:48,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:16:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787674573] [2025-03-17 14:16:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:48,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:48,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:48,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2025-03-17 14:16:48,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:48,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:48,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2025-03-17 14:16:48,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:48,917 INFO L124 PetriNetUnfolderBase]: 50/149 cut-off events. [2025-03-17 14:16:48,917 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:16:48,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 149 events. 50/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 527 event pairs, 49 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 263. Up to 120 conditions per place. [2025-03-17 14:16:48,919 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 21 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2025-03-17 14:16:48,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 142 flow [2025-03-17 14:16:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-03-17 14:16:48,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-03-17 14:16:48,920 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 102 flow. Second operand 3 states and 47 transitions. [2025-03-17 14:16:48,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 142 flow [2025-03-17 14:16:48,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 128 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:48,921 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 86 flow [2025-03-17 14:16:48,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-03-17 14:16:48,922 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-03-17 14:16:48,922 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 86 flow [2025-03-17 14:16:48,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:48,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:48,922 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:16:48,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:48,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1366783452, now seen corresponding path program 1 times [2025-03-17 14:16:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387098376] [2025-03-17 14:16:48,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:48,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:16:48,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:16:48,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:48,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:49,040 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-17 14:16:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387098376] [2025-03-17 14:16:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387098376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579322938] [2025-03-17 14:16:49,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:49,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:49,043 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:16:49,044 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:16:49,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:16:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:16:49,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:49,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:16:49,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:49,116 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-17 14:16:49,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:49,161 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-17 14:16:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579322938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:49,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 14:16:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702245577] [2025-03-17 14:16:49,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:49,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:16:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:49,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:16:49,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:16:49,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2025-03-17 14:16:49,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 86 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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:49,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:49,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2025-03-17 14:16:49,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:49,237 INFO L124 PetriNetUnfolderBase]: 50/155 cut-off events. [2025-03-17 14:16:49,238 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-17 14:16:49,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 155 events. 50/155 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 527 event pairs, 49 based on Foata normal form. 6/152 useless extension candidates. Maximal degree in co-relation 303. Up to 117 conditions per place. [2025-03-17 14:16:49,239 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 17 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2025-03-17 14:16:49,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 36 transitions, 178 flow [2025-03-17 14:16:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:16:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:16:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2025-03-17 14:16:49,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2025-03-17 14:16:49,242 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 86 flow. Second operand 12 states and 166 transitions. [2025-03-17 14:16:49,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 36 transitions, 178 flow [2025-03-17 14:16:49,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 36 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:49,244 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 169 flow [2025-03-17 14:16:49,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-03-17 14:16:49,245 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-03-17 14:16:49,245 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 169 flow [2025-03-17 14:16:49,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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:49,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:49,245 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:49,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:16:49,446 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-17 14:16:49,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:49,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1501494684, now seen corresponding path program 2 times [2025-03-17 14:16:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196473741] [2025-03-17 14:16:49,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:49,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 14:16:49,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 17 statements. [2025-03-17 14:16:49,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:16:49,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:49,563 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-17 14:16:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196473741] [2025-03-17 14:16:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196473741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952133100] [2025-03-17 14:16:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:49,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:49,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:49,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2025-03-17 14:16:49,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:49,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:49,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2025-03-17 14:16:49,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:49,635 INFO L124 PetriNetUnfolderBase]: 50/151 cut-off events. [2025-03-17 14:16:49,635 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 14:16:49,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 151 events. 50/151 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 492 event pairs, 42 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 322. Up to 99 conditions per place. [2025-03-17 14:16:49,637 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 29 selfloop transitions, 3 changer transitions 3/41 dead transitions. [2025-03-17 14:16:49,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 249 flow [2025-03-17 14:16:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-17 14:16:49,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2025-03-17 14:16:49,638 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 169 flow. Second operand 4 states and 63 transitions. [2025-03-17 14:16:49,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 249 flow [2025-03-17 14:16:49,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 201 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-17 14:16:49,642 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 123 flow [2025-03-17 14:16:49,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-03-17 14:16:49,643 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-03-17 14:16:49,643 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 123 flow [2025-03-17 14:16:49,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:49,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:49,643 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:16:49,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1501418877, now seen corresponding path program 1 times [2025-03-17 14:16:49,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:49,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406800611] [2025-03-17 14:16:49,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:49,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:16:49,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:16:49,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:49,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:49,749 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-17 14:16:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406800611] [2025-03-17 14:16:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406800611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:49,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726052422] [2025-03-17 14:16:49,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:49,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:49,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:49,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-17 14:16:49,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:49,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:49,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-17 14:16:49,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:49,828 INFO L124 PetriNetUnfolderBase]: 50/144 cut-off events. [2025-03-17 14:16:49,829 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-17 14:16:49,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 144 events. 50/144 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 480 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 301. Up to 105 conditions per place. [2025-03-17 14:16:49,830 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 33 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-17 14:16:49,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 205 flow [2025-03-17 14:16:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-03-17 14:16:49,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2025-03-17 14:16:49,831 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 123 flow. Second operand 4 states and 55 transitions. [2025-03-17 14:16:49,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 205 flow [2025-03-17 14:16:49,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 197 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:16:49,835 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 117 flow [2025-03-17 14:16:49,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=4, PETRI_FLOW=117, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2025-03-17 14:16:49,836 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2025-03-17 14:16:49,837 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 117 flow [2025-03-17 14:16:49,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:49,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:49,837 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:49,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:16:49,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:49,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1501418876, now seen corresponding path program 1 times [2025-03-17 14:16:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863043500] [2025-03-17 14:16:49,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:49,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:16:49,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:16:49,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:49,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:49,988 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-17 14:16:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863043500] [2025-03-17 14:16:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863043500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:49,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:49,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:49,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287446827] [2025-03-17 14:16:49,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:49,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:49,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:49,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:49,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:50,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2025-03-17 14:16:50,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:50,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:50,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2025-03-17 14:16:50,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:50,077 INFO L124 PetriNetUnfolderBase]: 50/135 cut-off events. [2025-03-17 14:16:50,077 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-17 14:16:50,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 135 events. 50/135 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 367 event pairs, 30 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 291. Up to 105 conditions per place. [2025-03-17 14:16:50,078 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2025-03-17 14:16:50,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 197 flow [2025-03-17 14:16:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-17 14:16:50,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2025-03-17 14:16:50,079 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 117 flow. Second operand 4 states and 63 transitions. [2025-03-17 14:16:50,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 197 flow [2025-03-17 14:16:50,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:50,081 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 112 flow [2025-03-17 14:16:50,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2025-03-17 14:16:50,081 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-03-17 14:16:50,081 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 112 flow [2025-03-17 14:16:50,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:50,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:50,082 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:50,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:16:50,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:50,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1605853378, now seen corresponding path program 1 times [2025-03-17 14:16:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476228712] [2025-03-17 14:16:50,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:50,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:16:50,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:16:50,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:50,126 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-17 14:16:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:50,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476228712] [2025-03-17 14:16:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476228712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:50,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:50,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:16:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764675117] [2025-03-17 14:16:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:50,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:50,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:50,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-03-17 14:16:50,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:50,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:50,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-03-17 14:16:50,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:50,164 INFO L124 PetriNetUnfolderBase]: 43/113 cut-off events. [2025-03-17 14:16:50,164 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-17 14:16:50,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 113 events. 43/113 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 272 event pairs, 42 based on Foata normal form. 8/120 useless extension candidates. Maximal degree in co-relation 260. Up to 111 conditions per place. [2025-03-17 14:16:50,165 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2025-03-17 14:16:50,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 28 transitions, 164 flow [2025-03-17 14:16:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-17 14:16:50,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-17 14:16:50,166 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 112 flow. Second operand 3 states and 48 transitions. [2025-03-17 14:16:50,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 28 transitions, 164 flow [2025-03-17 14:16:50,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 28 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:50,167 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2025-03-17 14:16:50,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2025-03-17 14:16:50,167 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2025-03-17 14:16:50,167 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2025-03-17 14:16:50,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:50,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-03-17 14:16:50,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-17 14:16:50,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-17 14:16:50,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-03-17 14:16:50,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-03-17 14:16:50,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-03-17 14:16:50,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-17 14:16:50,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-03-17 14:16:50,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-03-17 14:16:50,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-03-17 14:16:50,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-03-17 14:16:50,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-17 14:16:50,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-17 14:16:50,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-03-17 14:16:50,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:16:50,171 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-17 14:16:50,175 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:16:50,175 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:16:50,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:16:50 BasicIcfg [2025-03-17 14:16:50,178 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:16:50,179 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:16:50,179 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:16:50,179 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:16:50,180 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:47" (3/4) ... [2025-03-17 14:16:50,181 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:16:50,182 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-17 14:16:50,186 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2025-03-17 14:16:50,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-17 14:16:50,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 14:16:50,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:16:50,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 14:16:50,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:16:50,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:16:50,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:16:50,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:16:50,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:16:50,252 INFO L158 Benchmark]: Toolchain (without parser) took 3706.94ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 104.8MB in the beginning and 182.5MB in the end (delta: -77.7MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. [2025-03-17 14:16:50,252 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:50,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.06ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 74.9MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 14:16:50,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.55ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:50,254 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 70.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:50,255 INFO L158 Benchmark]: IcfgBuilder took 607.44ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 42.9MB in the end (delta: 27.8MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-03-17 14:16:50,255 INFO L158 Benchmark]: TraceAbstraction took 2520.63ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 42.1MB in the beginning and 187.6MB in the end (delta: -145.4MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2025-03-17 14:16:50,256 INFO L158 Benchmark]: Witness Printer took 72.58ms. Allocated memory is still 310.4MB. Free memory was 187.6MB in the beginning and 182.5MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:50,257 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.06ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 74.9MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.55ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 70.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 607.44ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 42.9MB in the end (delta: 27.8MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2520.63ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 42.1MB in the beginning and 187.6MB in the end (delta: -145.4MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Witness Printer took 72.58ms. Allocated memory is still 310.4MB. Free memory was 187.6MB in the beginning and 182.5MB in the end (delta: 5.1MB). 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: 936]: 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, 42 locations, 41 edges, 14 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.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 373 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 12 mSDtfsCounter, 373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=4, InterpolantAutomatonStates: 39, 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.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 806 SizeOfPredicates, 0 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 230/263 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 14:16:50,273 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